./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-18 21:15:01,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:15:01,232 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:15:01,274 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:15:01,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:15:01,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:15:01,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:15:01,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:15:01,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:15:01,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:15:01,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:15:01,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:15:01,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:15:01,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:15:01,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:15:01,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:15:01,310 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:15:01,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:15:01,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:15:01,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:15:01,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:15:01,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:15:01,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:15:01,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:15:01,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:15:01,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:15:01,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:15:01,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:15:01,335 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:15:01,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:15:01,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:15:01,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:15:01,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:15:01,339 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:15:01,340 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:15:01,340 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:15:01,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:15:01,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:15:01,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:15:01,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:15:01,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:15:01,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:15:01,382 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:15:01,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:15:01,383 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:15:01,383 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:15:01,384 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:15:01,384 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:15:01,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:15:01,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:15:01,385 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:15:01,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:15:01,386 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:15:01,386 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:15:01,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:15:01,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:15:01,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:15:01,387 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:15:01,387 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:15:01,387 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:15:01,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:15:01,387 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:15:01,387 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:15:01,388 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:15:01,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:15:01,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:15:01,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:15:01,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:15:01,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:15:01,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:15:01,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:15:01,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:15:01,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:15:01,389 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 [2021-12-18 21:15:01,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:15:01,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:15:01,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:15:01,614 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:15:01,615 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:15:01,616 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 [2021-12-18 21:15:01,679 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a45ff4b/62e64b64e6764f82ae9a0947d9ee50ca/FLAGdef48754c [2021-12-18 21:15:02,125 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:15:02,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2021-12-18 21:15:02,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a45ff4b/62e64b64e6764f82ae9a0947d9ee50ca/FLAGdef48754c [2021-12-18 21:15:02,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35a45ff4b/62e64b64e6764f82ae9a0947d9ee50ca [2021-12-18 21:15:02,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:15:02,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:15:02,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:15:02,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:15:02,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:15:02,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:15:02" (1/1) ... [2021-12-18 21:15:02,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55796ec9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:02, skipping insertion in model container [2021-12-18 21:15:02,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:15:02" (1/1) ... [2021-12-18 21:15:02,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:15:02,526 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:15:02,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:15:02,841 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-18 21:15:02,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3369c691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:02, skipping insertion in model container [2021-12-18 21:15:02,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:15:02,843 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-18 21:15:02,845 INFO L158 Benchmark]: Toolchain (without parser) took 369.04ms. Allocated memory is still 107.0MB. Free memory was 74.9MB in the beginning and 61.6MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 21:15:02,846 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:15:02,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.90ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 61.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 21:15:02,849 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.17ms. Allocated memory is still 83.9MB. Free memory is still 53.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.90ms. Allocated memory is still 107.0MB. Free memory was 74.7MB in the beginning and 61.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- 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-tmp.no-commuhash-c3fed41 [2021-12-18 21:15:04,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:15:04,646 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:15:04,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:15:04,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:15:04,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:15:04,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:15:04,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:15:04,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:15:04,680 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:15:04,681 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:15:04,685 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:15:04,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:15:04,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:15:04,691 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:15:04,692 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:15:04,693 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:15:04,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:15:04,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:15:04,700 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:15:04,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:15:04,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:15:04,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:15:04,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:15:04,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:15:04,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:15:04,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:15:04,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:15:04,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:15:04,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:15:04,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:15:04,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:15:04,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:15:04,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:15:04,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:15:04,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:15:04,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:15:04,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:15:04,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:15:04,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:15:04,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:15:04,716 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 21:15:04,742 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:15:04,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:15:04,744 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:15:04,744 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:15:04,745 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:15:04,745 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:15:04,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:15:04,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:15:04,747 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:15:04,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:15:04,748 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:15:04,748 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:15:04,748 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:15:04,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:15:04,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:15:04,749 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:15:04,749 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:15:04,749 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:15:04,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:15:04,750 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:15:04,750 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 21:15:04,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 21:15:04,750 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:15:04,751 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:15:04,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:15:04,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:15:04,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:15:04,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:15:04,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:15:04,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:15:04,752 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 21:15:04,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 21:15:04,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:15:04,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 21:15:04,753 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 [2021-12-18 21:15:05,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:15:05,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:15:05,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:15:05,112 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:15:05,112 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:15:05,114 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 [2021-12-18 21:15:05,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f672a87bb/08cd1747c3e94047ad41650c662d2166/FLAG525d2083c [2021-12-18 21:15:05,724 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:15:05,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-1.i [2021-12-18 21:15:05,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f672a87bb/08cd1747c3e94047ad41650c662d2166/FLAG525d2083c [2021-12-18 21:15:06,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f672a87bb/08cd1747c3e94047ad41650c662d2166 [2021-12-18 21:15:06,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:15:06,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:15:06,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:15:06,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:15:06,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:15:06,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:06,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572c19c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06, skipping insertion in model container [2021-12-18 21:15:06,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:06,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:15:06,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:15:06,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:15:06,698 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 21:15:06,710 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:15:06,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:15:06,781 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:15:06,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:15:06,894 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:15:06,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06 WrapperNode [2021-12-18 21:15:06,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:15:06,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:15:06,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:15:06,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:15:06,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:06,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:06,975 INFO L137 Inliner]: procedures = 167, calls = 73, calls flagged for inlining = 25, calls inlined = 19, statements flattened = 124 [2021-12-18 21:15:06,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:15:06,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:15:06,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:15:06,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:15:06,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:06,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:15:07,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:15:07,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:15:07,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:15:07,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (1/1) ... [2021-12-18 21:15:07,050 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:15:07,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:15:07,072 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 21:15:07,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 21:15:07,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 21:15:07,111 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-12-18 21:15:07,111 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-12-18 21:15:07,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 21:15:07,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 21:15:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-12-18 21:15:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-12-18 21:15:07,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:15:07,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:15:07,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:15:07,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:15:07,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 21:15:07,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:15:07,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 21:15:07,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:15:07,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:15:07,251 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:15:07,252 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:15:07,618 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:15:07,627 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:15:07,627 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-18 21:15:07,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:15:07 BoogieIcfgContainer [2021-12-18 21:15:07,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:15:07,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:15:07,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:15:07,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:15:07,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:15:06" (1/3) ... [2021-12-18 21:15:07,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38534b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:15:07, skipping insertion in model container [2021-12-18 21:15:07,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:15:06" (2/3) ... [2021-12-18 21:15:07,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38534b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:15:07, skipping insertion in model container [2021-12-18 21:15:07,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:15:07" (3/3) ... [2021-12-18 21:15:07,640 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-1.i [2021-12-18 21:15:07,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:15:07,646 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2021-12-18 21:15:07,693 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:15:07,699 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:15:07,700 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2021-12-18 21:15:07,716 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) [2021-12-18 21:15:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:15:07,726 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:07,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:07,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash 886333963, now seen corresponding path program 1 times [2021-12-18 21:15:07,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:07,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307878638] [2021-12-18 21:15:07,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:07,744 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:07,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:07,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:15:07,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 21:15:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:07,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:15:07,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:07,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:08,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:08,021 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:08,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307878638] [2021-12-18 21:15:08,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307878638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:08,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:08,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:15:08,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877960284] [2021-12-18 21:15:08,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:08,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:15:08,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:08,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:15:08,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:15:08,059 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) [2021-12-18 21:15:08,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:08,452 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2021-12-18 21:15:08,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:15:08,455 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 [2021-12-18 21:15:08,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:08,469 INFO L225 Difference]: With dead ends: 158 [2021-12-18 21:15:08,469 INFO L226 Difference]: Without dead ends: 156 [2021-12-18 21:15:08,472 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:08,481 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 97 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:08,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 387 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:15:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-18 21:15:08,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 95. [2021-12-18 21:15:08,523 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) [2021-12-18 21:15:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2021-12-18 21:15:08,526 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 10 [2021-12-18 21:15:08,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:08,527 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2021-12-18 21:15:08,527 INFO L471 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) [2021-12-18 21:15:08,527 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2021-12-18 21:15:08,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:15:08,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:08,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:08,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:08,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:08,732 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:08,733 INFO L85 PathProgramCache]: Analyzing trace with hash 914963114, now seen corresponding path program 1 times [2021-12-18 21:15:08,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652454465] [2021-12-18 21:15:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:08,734 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:08,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:15:08,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 21:15:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:08,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:15:08,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:08,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:08,880 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:08,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652454465] [2021-12-18 21:15:08,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652454465] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:08,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:08,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:15:08,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039733951] [2021-12-18 21:15:08,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:08,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:15:08,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:08,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:15:08,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:15:08,883 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) [2021-12-18 21:15:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:08,906 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2021-12-18 21:15:08,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:15:08,907 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 [2021-12-18 21:15:08,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:08,908 INFO L225 Difference]: With dead ends: 114 [2021-12-18 21:15:08,908 INFO L226 Difference]: Without dead ends: 114 [2021-12-18 21:15:08,909 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:08,910 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 19 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:08,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:08,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-12-18 21:15:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 93. [2021-12-18 21:15:08,916 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) [2021-12-18 21:15:08,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2021-12-18 21:15:08,918 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 10 [2021-12-18 21:15:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:08,918 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2021-12-18 21:15:08,919 INFO L471 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) [2021-12-18 21:15:08,919 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2021-12-18 21:15:08,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:15:08,919 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:08,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:08,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-18 21:15:09,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:09,129 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:09,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1706549126, now seen corresponding path program 1 times [2021-12-18 21:15:09,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:09,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487748432] [2021-12-18 21:15:09,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:09,131 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:09,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:09,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:15:09,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 21:15:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:09,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:15:09,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:09,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:09,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:09,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:09,333 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:09,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487748432] [2021-12-18 21:15:09,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487748432] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:09,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:09,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:15:09,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259880380] [2021-12-18 21:15:09,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:09,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:15:09,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:09,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:15:09,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:15:09,336 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) [2021-12-18 21:15:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:09,730 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2021-12-18 21:15:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:15:09,732 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 [2021-12-18 21:15:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:09,733 INFO L225 Difference]: With dead ends: 134 [2021-12-18 21:15:09,733 INFO L226 Difference]: Without dead ends: 134 [2021-12-18 21:15:09,734 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:09,736 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 73 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:09,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 469 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:15:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2021-12-18 21:15:09,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2021-12-18 21:15:09,742 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) [2021-12-18 21:15:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2021-12-18 21:15:09,744 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 11 [2021-12-18 21:15:09,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:09,744 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2021-12-18 21:15:09,744 INFO L471 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) [2021-12-18 21:15:09,745 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2021-12-18 21:15:09,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:15:09,745 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:09,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:09,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:09,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:09,955 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:09,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:09,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1363388625, now seen corresponding path program 1 times [2021-12-18 21:15:09,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:09,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189765222] [2021-12-18 21:15:09,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:09,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:09,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:09,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:15:09,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 21:15:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:10,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:15:10,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:10,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:10,094 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:10,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189765222] [2021-12-18 21:15:10,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189765222] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:10,095 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:10,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:15:10,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94269408] [2021-12-18 21:15:10,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:10,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:15:10,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:10,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:15:10,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:15:10,097 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) [2021-12-18 21:15:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:10,120 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2021-12-18 21:15:10,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:15:10,121 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 [2021-12-18 21:15:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:10,122 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:15:10,122 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:15:10,123 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:10,125 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:10,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 424 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:10,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:15:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 92. [2021-12-18 21:15:10,140 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) [2021-12-18 21:15:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2021-12-18 21:15:10,144 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2021-12-18 21:15:10,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:10,145 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2021-12-18 21:15:10,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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) [2021-12-18 21:15:10,145 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2021-12-18 21:15:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:15:10,148 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:10,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:10,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:10,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:10,360 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:10,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1188768336, now seen corresponding path program 1 times [2021-12-18 21:15:10,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:10,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573417999] [2021-12-18 21:15:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:10,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:10,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:10,362 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) [2021-12-18 21:15:10,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 21:15:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:10,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:15:10,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:10,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:10,475 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:10,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573417999] [2021-12-18 21:15:10,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573417999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:10,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:10,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:15:10,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535439279] [2021-12-18 21:15:10,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:10,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:15:10,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:10,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:15:10,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:15:10,478 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) [2021-12-18 21:15:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:10,511 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2021-12-18 21:15:10,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:15:10,511 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 [2021-12-18 21:15:10,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:10,512 INFO L225 Difference]: With dead ends: 112 [2021-12-18 21:15:10,513 INFO L226 Difference]: Without dead ends: 112 [2021-12-18 21:15:10,513 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:10,515 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:10,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 288 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-12-18 21:15:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2021-12-18 21:15:10,520 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) [2021-12-18 21:15:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2021-12-18 21:15:10,521 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 12 [2021-12-18 21:15:10,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:10,521 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2021-12-18 21:15:10,521 INFO L471 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) [2021-12-18 21:15:10,522 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2021-12-18 21:15:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-18 21:15:10,522 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:10,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:10,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:10,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:10,731 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:10,732 INFO L85 PathProgramCache]: Analyzing trace with hash 86428473, now seen corresponding path program 1 times [2021-12-18 21:15:10,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464559630] [2021-12-18 21:15:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:10,733 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:10,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:10,734 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) [2021-12-18 21:15:10,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 21:15:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:10,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:15:10,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:10,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:10,838 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:10,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464559630] [2021-12-18 21:15:10,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464559630] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:10,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:10,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:15:10,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533435056] [2021-12-18 21:15:10,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:10,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:15:10,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:10,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:15:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:15:10,840 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) [2021-12-18 21:15:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:10,864 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2021-12-18 21:15:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:15:10,866 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 [2021-12-18 21:15:10,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:10,867 INFO L225 Difference]: With dead ends: 104 [2021-12-18 21:15:10,867 INFO L226 Difference]: Without dead ends: 104 [2021-12-18 21:15:10,867 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:10,868 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:10,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-12-18 21:15:10,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-12-18 21:15:10,871 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) [2021-12-18 21:15:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2021-12-18 21:15:10,872 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 16 [2021-12-18 21:15:10,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:10,873 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2021-12-18 21:15:10,873 INFO L471 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) [2021-12-18 21:15:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2021-12-18 21:15:10,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 21:15:10,874 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:10,874 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:10,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:11,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:11,083 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:11,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1674943760, now seen corresponding path program 1 times [2021-12-18 21:15:11,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:11,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138574889] [2021-12-18 21:15:11,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:11,084 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:11,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:11,085 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) [2021-12-18 21:15:11,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 21:15:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:11,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:15:11,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:11,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:11,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:15:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:11,275 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:11,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138574889] [2021-12-18 21:15:11,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138574889] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:15:11,276 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:15:11,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-18 21:15:11,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008706777] [2021-12-18 21:15:11,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:15:11,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:15:11,278 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:11,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:15:11,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:15:11,279 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) [2021-12-18 21:15:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:11,343 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2021-12-18 21:15:11,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:15:11,344 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 [2021-12-18 21:15:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:11,344 INFO L225 Difference]: With dead ends: 107 [2021-12-18 21:15:11,344 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 21:15:11,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:15:11,345 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:11,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 21:15:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2021-12-18 21:15:11,348 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) [2021-12-18 21:15:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2021-12-18 21:15:11,349 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 17 [2021-12-18 21:15:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:11,349 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2021-12-18 21:15:11,349 INFO L471 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) [2021-12-18 21:15:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2021-12-18 21:15:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 21:15:11,350 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:11,350 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:11,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:11,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:11,562 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:11,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:11,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1276371002, now seen corresponding path program 1 times [2021-12-18 21:15:11,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:11,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802813578] [2021-12-18 21:15:11,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:11,563 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:11,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:11,566 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) [2021-12-18 21:15:11,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 21:15:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:11,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:15:11,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:11,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:11,765 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802813578] [2021-12-18 21:15:11,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802813578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:11,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:11,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:15:11,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013734190] [2021-12-18 21:15:11,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:11,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:15:11,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:11,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:15:11,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:15:11,767 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) [2021-12-18 21:15:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:11,839 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-18 21:15:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:15:11,840 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 [2021-12-18 21:15:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:11,841 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:15:11,841 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:15:11,841 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:11,842 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 21 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:11,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 553 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:11,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:15:11,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2021-12-18 21:15:11,846 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) [2021-12-18 21:15:11,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2021-12-18 21:15:11,846 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 18 [2021-12-18 21:15:11,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:11,847 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2021-12-18 21:15:11,847 INFO L471 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) [2021-12-18 21:15:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2021-12-18 21:15:11,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:15:11,848 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:11,848 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:11,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:12,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:12,058 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719801, now seen corresponding path program 2 times [2021-12-18 21:15:12,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:12,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135026137] [2021-12-18 21:15:12,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:15:12,059 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:12,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:12,060 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) [2021-12-18 21:15:12,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 21:15:12,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:15:12,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:15:12,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 21:15:12,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:12,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-18 21:15:12,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:12,230 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:12,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135026137] [2021-12-18 21:15:12,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135026137] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:12,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:12,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:15:12,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674501919] [2021-12-18 21:15:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:12,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-18 21:15:12,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:12,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-18 21:15:12,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:15:12,233 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) [2021-12-18 21:15:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:12,599 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2021-12-18 21:15:12,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:15:12,600 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 [2021-12-18 21:15:12,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:12,601 INFO L225 Difference]: With dead ends: 142 [2021-12-18 21:15:12,601 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 21:15:12,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:15:12,602 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 95 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:12,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 537 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:15:12,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 21:15:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 107. [2021-12-18 21:15:12,606 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) [2021-12-18 21:15:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2021-12-18 21:15:12,607 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 20 [2021-12-18 21:15:12,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:12,607 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2021-12-18 21:15:12,608 INFO L471 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) [2021-12-18 21:15:12,608 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2021-12-18 21:15:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:15:12,608 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:12,609 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:12,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:12,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:12,816 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1965719802, now seen corresponding path program 1 times [2021-12-18 21:15:12,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:12,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239821155] [2021-12-18 21:15:12,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:12,817 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:12,818 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) [2021-12-18 21:15:12,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 21:15:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:12,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:15:12,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:12,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:15:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:13,156 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:13,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239821155] [2021-12-18 21:15:13,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239821155] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:15:13,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:15:13,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-12-18 21:15:13,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696135507] [2021-12-18 21:15:13,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:15:13,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:15:13,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:15:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:15:13,159 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) [2021-12-18 21:15:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:13,382 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-18 21:15:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:15:13,383 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 [2021-12-18 21:15:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:13,385 INFO L225 Difference]: With dead ends: 116 [2021-12-18 21:15:13,385 INFO L226 Difference]: Without dead ends: 116 [2021-12-18 21:15:13,386 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:15:13,387 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:13,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 782 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:15:13,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-18 21:15:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2021-12-18 21:15:13,392 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) [2021-12-18 21:15:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2021-12-18 21:15:13,393 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 20 [2021-12-18 21:15:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:13,394 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2021-12-18 21:15:13,395 INFO L471 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) [2021-12-18 21:15:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2021-12-18 21:15:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:15:13,397 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:13,397 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:13,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:13,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:13,606 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1184735654, now seen corresponding path program 1 times [2021-12-18 21:15:13,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:13,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906255347] [2021-12-18 21:15:13,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:13,607 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:13,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:13,608 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) [2021-12-18 21:15:13,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 21:15:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:13,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:15:13,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-18 21:15:13,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:13,741 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:13,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906255347] [2021-12-18 21:15:13,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906255347] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:13,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:13,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:15:13,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518042532] [2021-12-18 21:15:13,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:13,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:15:13,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:15:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:15:13,743 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) [2021-12-18 21:15:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:13,843 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2021-12-18 21:15:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:15:13,843 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 [2021-12-18 21:15:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:13,844 INFO L225 Difference]: With dead ends: 119 [2021-12-18 21:15:13,844 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 21:15:13,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:15:13,845 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:13,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 188 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:15:13,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 21:15:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-12-18 21:15:13,847 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) [2021-12-18 21:15:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2021-12-18 21:15:13,848 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 27 [2021-12-18 21:15:13,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:13,848 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2021-12-18 21:15:13,849 INFO L471 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) [2021-12-18 21:15:13,849 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2021-12-18 21:15:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 21:15:13,849 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:13,849 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:13,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:14,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:14,059 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash -103060070, now seen corresponding path program 2 times [2021-12-18 21:15:14,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:14,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248533398] [2021-12-18 21:15:14,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:15:14,060 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:14,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:14,061 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) [2021-12-18 21:15:14,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 21:15:14,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:15:14,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:15:14,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 21:15:14,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:14,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-18 21:15:14,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:14,332 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:14,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248533398] [2021-12-18 21:15:14,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248533398] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:14,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:14,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:15:14,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323547965] [2021-12-18 21:15:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:14,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:15:14,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:15:14,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:15:14,333 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) [2021-12-18 21:15:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:14,759 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2021-12-18 21:15:14,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:15:14,760 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 [2021-12-18 21:15:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:14,761 INFO L225 Difference]: With dead ends: 141 [2021-12-18 21:15:14,761 INFO L226 Difference]: Without dead ends: 141 [2021-12-18 21:15:14,761 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:14,762 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 105 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:14,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 621 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 21:15:14,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-12-18 21:15:14,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2021-12-18 21:15:14,765 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) [2021-12-18 21:15:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2021-12-18 21:15:14,766 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 26 [2021-12-18 21:15:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:14,766 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2021-12-18 21:15:14,766 INFO L471 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) [2021-12-18 21:15:14,766 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2021-12-18 21:15:14,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 21:15:14,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:14,767 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:14,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:14,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:14,976 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash -257987495, now seen corresponding path program 1 times [2021-12-18 21:15:14,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:14,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214499965] [2021-12-18 21:15:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:14,980 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:14,982 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) [2021-12-18 21:15:14,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 21:15:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:15,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 21:15:15,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:15,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:15:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:15:15,689 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:15,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214499965] [2021-12-18 21:15:15,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214499965] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:15:15,689 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:15:15,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2021-12-18 21:15:15,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20991874] [2021-12-18 21:15:15,690 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:15:15,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-18 21:15:15,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:15,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-18 21:15:15,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2021-12-18 21:15:15,692 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) [2021-12-18 21:15:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:16,030 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2021-12-18 21:15:16,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 21:15:16,031 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 [2021-12-18 21:15:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:16,031 INFO L225 Difference]: With dead ends: 102 [2021-12-18 21:15:16,031 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 21:15:16,032 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:16,032 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-12-18 21:15:16,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 1236 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:15:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 21:15:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-18 21:15:16,038 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) [2021-12-18 21:15:16,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2021-12-18 21:15:16,039 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 28 [2021-12-18 21:15:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:16,039 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2021-12-18 21:15:16,040 INFO L471 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) [2021-12-18 21:15:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2021-12-18 21:15:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-18 21:15:16,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:16,043 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:16,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:16,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:16,252 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2039891719, now seen corresponding path program 2 times [2021-12-18 21:15:16,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911270697] [2021-12-18 21:15:16,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:15:16,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:16,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:16,253 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) [2021-12-18 21:15:16,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 21:15:16,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-18 21:15:16,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:15:16,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:15:16,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:16,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:16,425 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911270697] [2021-12-18 21:15:16,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911270697] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:16,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:16,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:15:16,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869195960] [2021-12-18 21:15:16,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:16,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:15:16,426 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:16,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:15:16,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:15:16,427 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) [2021-12-18 21:15:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:16,462 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2021-12-18 21:15:16,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:15:16,463 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 [2021-12-18 21:15:16,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:16,465 INFO L225 Difference]: With dead ends: 102 [2021-12-18 21:15:16,465 INFO L226 Difference]: Without dead ends: 102 [2021-12-18 21:15:16,465 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:16,466 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:16,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 372 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-12-18 21:15:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2021-12-18 21:15:16,469 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) [2021-12-18 21:15:16,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2021-12-18 21:15:16,470 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 34 [2021-12-18 21:15:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:16,470 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2021-12-18 21:15:16,471 INFO L471 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) [2021-12-18 21:15:16,471 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2021-12-18 21:15:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:15:16,471 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:16,471 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:16,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:16,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:16,681 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:16,681 INFO L85 PathProgramCache]: Analyzing trace with hash -382086172, now seen corresponding path program 1 times [2021-12-18 21:15:16,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:16,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918300503] [2021-12-18 21:15:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:16,681 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:16,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:16,682 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) [2021-12-18 21:15:16,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 21:15:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:16,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 21:15:16,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:16,829 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:16,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:16,940 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:16,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918300503] [2021-12-18 21:15:16,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918300503] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:16,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:16,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:15:16,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745696809] [2021-12-18 21:15:16,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:16,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:15:16,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:16,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:15:16,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:15:16,942 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) [2021-12-18 21:15:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:17,226 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-12-18 21:15:17,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:15:17,227 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 [2021-12-18 21:15:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:17,227 INFO L225 Difference]: With dead ends: 100 [2021-12-18 21:15:17,228 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 21:15:17,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:15:17,228 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 77 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-12-18 21:15:17,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 391 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:15:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 21:15:17,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-12-18 21:15:17,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) [2021-12-18 21:15:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2021-12-18 21:15:17,231 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 36 [2021-12-18 21:15:17,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:17,232 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2021-12-18 21:15:17,232 INFO L471 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) [2021-12-18 21:15:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2021-12-18 21:15:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:15:17,233 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:17,233 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:17,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:17,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:17,440 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash -382086171, now seen corresponding path program 1 times [2021-12-18 21:15:17,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:17,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063342895] [2021-12-18 21:15:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:17,441 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:17,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:17,442 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) [2021-12-18 21:15:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 21:15:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:17,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-18 21:15:17,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:17,612 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:17,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:17,857 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:17,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063342895] [2021-12-18 21:15:17,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063342895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:17,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:17,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:15:17,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378919974] [2021-12-18 21:15:17,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:17,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:15:17,858 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:15:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:15:17,858 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) [2021-12-18 21:15:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:18,187 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2021-12-18 21:15:18,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:15:18,188 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 [2021-12-18 21:15:18,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:18,188 INFO L225 Difference]: With dead ends: 98 [2021-12-18 21:15:18,188 INFO L226 Difference]: Without dead ends: 98 [2021-12-18 21:15:18,189 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:18,189 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 84 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:18,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 473 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:15:18,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-18 21:15:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-18 21:15:18,191 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) [2021-12-18 21:15:18,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2021-12-18 21:15:18,192 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2021-12-18 21:15:18,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:18,192 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2021-12-18 21:15:18,192 INFO L471 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) [2021-12-18 21:15:18,192 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2021-12-18 21:15:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-18 21:15:18,193 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:18,193 INFO L514 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:15:18,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:18,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:18,394 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:18,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash -432796251, now seen corresponding path program 1 times [2021-12-18 21:15:18,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:18,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110061904] [2021-12-18 21:15:18,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:18,395 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:18,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:18,395 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) [2021-12-18 21:15:18,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 21:15:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:18,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:15:18,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:18,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:18,621 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:18,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110061904] [2021-12-18 21:15:18,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110061904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:18,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:18,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:15:18,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952413892] [2021-12-18 21:15:18,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:18,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:15:18,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:18,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:15:18,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:15:18,624 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) [2021-12-18 21:15:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:18,667 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2021-12-18 21:15:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:15:18,668 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 [2021-12-18 21:15:18,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:18,669 INFO L225 Difference]: With dead ends: 98 [2021-12-18 21:15:18,669 INFO L226 Difference]: Without dead ends: 98 [2021-12-18 21:15:18,669 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:18,669 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 75 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:18,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 402 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-12-18 21:15:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2021-12-18 21:15:18,672 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) [2021-12-18 21:15:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2021-12-18 21:15:18,672 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 36 [2021-12-18 21:15:18,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:18,672 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2021-12-18 21:15:18,672 INFO L471 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) [2021-12-18 21:15:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2021-12-18 21:15:18,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 21:15:18,673 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:18,673 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:18,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:18,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:18,874 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:18,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash 74876930, now seen corresponding path program 1 times [2021-12-18 21:15:18,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:18,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374792902] [2021-12-18 21:15:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:18,875 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:18,876 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) [2021-12-18 21:15:18,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 21:15:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:19,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-18 21:15:19,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:19,049 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:19,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:19,201 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:19,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374792902] [2021-12-18 21:15:19,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374792902] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:19,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:19,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-18 21:15:19,202 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753820879] [2021-12-18 21:15:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:19,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:15:19,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:19,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:15:19,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:15:19,203 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) [2021-12-18 21:15:19,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:19,425 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2021-12-18 21:15:19,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:15:19,426 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 [2021-12-18 21:15:19,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:19,426 INFO L225 Difference]: With dead ends: 100 [2021-12-18 21:15:19,426 INFO L226 Difference]: Without dead ends: 100 [2021-12-18 21:15:19,427 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:15:19,427 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 65 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:19,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 347 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 20 Unchecked, 0.2s Time] [2021-12-18 21:15:19,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-12-18 21:15:19,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2021-12-18 21:15:19,430 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) [2021-12-18 21:15:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2021-12-18 21:15:19,431 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 44 [2021-12-18 21:15:19,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:19,431 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2021-12-18 21:15:19,431 INFO L471 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) [2021-12-18 21:15:19,431 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2021-12-18 21:15:19,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-18 21:15:19,432 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:19,432 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:19,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:19,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:19,643 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash 74876931, now seen corresponding path program 1 times [2021-12-18 21:15:19,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653501674] [2021-12-18 21:15:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:19,644 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:19,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:19,645 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) [2021-12-18 21:15:19,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 21:15:19,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:19,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 21:15:19,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:19,832 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:20,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:20,097 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:20,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653501674] [2021-12-18 21:15:20,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653501674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:20,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:20,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 21:15:20,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099744158] [2021-12-18 21:15:20,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:20,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:15:20,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:20,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:15:20,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:15:20,099 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) [2021-12-18 21:15:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:20,399 INFO L93 Difference]: Finished difference Result 103 states and 109 transitions. [2021-12-18 21:15:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:15:20,400 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 [2021-12-18 21:15:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:20,400 INFO L225 Difference]: With dead ends: 103 [2021-12-18 21:15:20,400 INFO L226 Difference]: Without dead ends: 103 [2021-12-18 21:15:20,401 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:20,401 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:20,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 473 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 173 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2021-12-18 21:15:20,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-12-18 21:15:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2021-12-18 21:15:20,404 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) [2021-12-18 21:15:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2021-12-18 21:15:20,404 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2021-12-18 21:15:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:20,404 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2021-12-18 21:15:20,404 INFO L471 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) [2021-12-18 21:15:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2021-12-18 21:15:20,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 21:15:20,405 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:20,405 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:20,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:20,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:20,619 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:20,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:20,619 INFO L85 PathProgramCache]: Analyzing trace with hash 496438540, now seen corresponding path program 1 times [2021-12-18 21:15:20,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:20,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972749838] [2021-12-18 21:15:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:20,620 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:20,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:20,622 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) [2021-12-18 21:15:20,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 21:15:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:20,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 21:15:20,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:20,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:20,961 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:20,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972749838] [2021-12-18 21:15:20,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972749838] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:20,962 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:20,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 21:15:20,962 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658048901] [2021-12-18 21:15:20,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:20,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 21:15:20,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:20,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 21:15:20,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:15:20,963 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) [2021-12-18 21:15:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:21,009 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2021-12-18 21:15:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:15:21,009 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 [2021-12-18 21:15:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:21,010 INFO L225 Difference]: With dead ends: 94 [2021-12-18 21:15:21,010 INFO L226 Difference]: Without dead ends: 94 [2021-12-18 21:15:21,010 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:21,012 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 42 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:21,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 395 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-12-18 21:15:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2021-12-18 21:15:21,025 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) [2021-12-18 21:15:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2021-12-18 21:15:21,027 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 50 [2021-12-18 21:15:21,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:21,028 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2021-12-18 21:15:21,028 INFO L471 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) [2021-12-18 21:15:21,028 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2021-12-18 21:15:21,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-18 21:15:21,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:21,029 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:21,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:21,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:21,241 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:21,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash -774905870, now seen corresponding path program 1 times [2021-12-18 21:15:21,242 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:21,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715605937] [2021-12-18 21:15:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:21,242 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:21,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:21,245 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) [2021-12-18 21:15:21,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 21:15:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:21,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:15:21,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:21,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:21,674 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:21,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:21,674 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:21,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715605937] [2021-12-18 21:15:21,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715605937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:21,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:21,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 21:15:21,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815090415] [2021-12-18 21:15:21,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:21,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:15:21,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:21,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:15:21,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:15:21,676 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) [2021-12-18 21:15:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:21,975 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2021-12-18 21:15:21,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:15:21,976 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 [2021-12-18 21:15:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:21,976 INFO L225 Difference]: With dead ends: 123 [2021-12-18 21:15:21,976 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 21:15:21,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:15:21,977 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 138 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:21,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 346 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 207 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2021-12-18 21:15:21,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 21:15:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-12-18 21:15:21,980 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) [2021-12-18 21:15:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2021-12-18 21:15:21,981 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 56 [2021-12-18 21:15:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:21,981 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2021-12-18 21:15:21,982 INFO L471 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) [2021-12-18 21:15:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2021-12-18 21:15:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-12-18 21:15:21,982 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:21,983 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:21,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2021-12-18 21:15:22,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:22,191 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash -774905869, now seen corresponding path program 1 times [2021-12-18 21:15:22,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:22,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129337674] [2021-12-18 21:15:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:22,193 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:22,194 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) [2021-12-18 21:15:22,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 21:15:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:22,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 21:15:22,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:22,447 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:22,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:22,841 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:22,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129337674] [2021-12-18 21:15:22,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129337674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:22,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:22,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:15:22,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001490495] [2021-12-18 21:15:22,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:22,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:15:22,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:22,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:15:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:15:22,844 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) [2021-12-18 21:15:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:23,184 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2021-12-18 21:15:23,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:15:23,187 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 [2021-12-18 21:15:23,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:23,188 INFO L225 Difference]: With dead ends: 111 [2021-12-18 21:15:23,188 INFO L226 Difference]: Without dead ends: 111 [2021-12-18 21:15:23,189 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:23,189 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:23,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 433 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 233 Invalid, 0 Unknown, 8 Unchecked, 0.2s Time] [2021-12-18 21:15:23,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2021-12-18 21:15:23,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2021-12-18 21:15:23,192 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) [2021-12-18 21:15:23,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2021-12-18 21:15:23,193 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 56 [2021-12-18 21:15:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:23,193 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2021-12-18 21:15:23,194 INFO L471 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) [2021-12-18 21:15:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2021-12-18 21:15:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 21:15:23,194 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:23,195 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:23,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:23,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:23,407 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:23,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:23,408 INFO L85 PathProgramCache]: Analyzing trace with hash -178952659, now seen corresponding path program 1 times [2021-12-18 21:15:23,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:23,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548083060] [2021-12-18 21:15:23,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:23,408 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:23,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:23,409 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) [2021-12-18 21:15:23,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 21:15:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:23,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 21:15:23,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:23,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:23,771 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:23,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548083060] [2021-12-18 21:15:23,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548083060] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:23,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:23,772 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-18 21:15:23,772 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818046235] [2021-12-18 21:15:23,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:23,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-18 21:15:23,772 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-18 21:15:23,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:15:23,773 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) [2021-12-18 21:15:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:23,859 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2021-12-18 21:15:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 21:15:23,859 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 [2021-12-18 21:15:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:23,860 INFO L225 Difference]: With dead ends: 111 [2021-12-18 21:15:23,860 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 21:15:23,860 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:23,861 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 71 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:23,861 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 527 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:15:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 21:15:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2021-12-18 21:15:23,864 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) [2021-12-18 21:15:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2021-12-18 21:15:23,865 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 62 [2021-12-18 21:15:23,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:23,865 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2021-12-18 21:15:23,865 INFO L471 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) [2021-12-18 21:15:23,865 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2021-12-18 21:15:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 21:15:23,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:23,866 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:23,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:24,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:24,078 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:24,079 INFO L85 PathProgramCache]: Analyzing trace with hash 59491574, now seen corresponding path program 1 times [2021-12-18 21:15:24,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:24,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958580169] [2021-12-18 21:15:24,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:24,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:24,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:24,080 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) [2021-12-18 21:15:24,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 21:15:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:24,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-18 21:15:24,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:24,417 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:24,641 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:24,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:24,642 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:24,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958580169] [2021-12-18 21:15:24,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958580169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:24,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:24,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:15:24,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673756549] [2021-12-18 21:15:24,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:24,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:15:24,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:24,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:15:24,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:15:24,643 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) [2021-12-18 21:15:25,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:25,048 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2021-12-18 21:15:25,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:15:25,048 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 [2021-12-18 21:15:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:25,049 INFO L225 Difference]: With dead ends: 116 [2021-12-18 21:15:25,049 INFO L226 Difference]: Without dead ends: 116 [2021-12-18 21:15:25,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:15:25,050 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2021-12-18 21:15:25,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 465 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 330 Invalid, 0 Unknown, 18 Unchecked, 0.3s Time] [2021-12-18 21:15:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-18 21:15:25,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2021-12-18 21:15:25,053 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) [2021-12-18 21:15:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2021-12-18 21:15:25,054 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 62 [2021-12-18 21:15:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:25,054 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2021-12-18 21:15:25,054 INFO L471 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) [2021-12-18 21:15:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2021-12-18 21:15:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-18 21:15:25,055 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:25,055 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:25,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:25,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:25,255 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:25,256 INFO L85 PathProgramCache]: Analyzing trace with hash 59491575, now seen corresponding path program 1 times [2021-12-18 21:15:25,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020384221] [2021-12-18 21:15:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:25,256 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:25,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:25,257 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) [2021-12-18 21:15:25,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-18 21:15:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:25,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-18 21:15:25,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:25,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:25,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:25,959 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:25,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020384221] [2021-12-18 21:15:25,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020384221] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:25,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:25,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-18 21:15:25,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424451553] [2021-12-18 21:15:25,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:25,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:15:25,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:25,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:15:25,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:15:25,960 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) [2021-12-18 21:15:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:26,381 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2021-12-18 21:15:26,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:15:26,382 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 [2021-12-18 21:15:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:26,382 INFO L225 Difference]: With dead ends: 126 [2021-12-18 21:15:26,383 INFO L226 Difference]: Without dead ends: 126 [2021-12-18 21:15:26,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2021-12-18 21:15:26,383 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 166 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:26,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 474 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 247 Invalid, 0 Unknown, 13 Unchecked, 0.3s Time] [2021-12-18 21:15:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-12-18 21:15:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2021-12-18 21:15:26,386 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) [2021-12-18 21:15:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2021-12-18 21:15:26,387 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 62 [2021-12-18 21:15:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:26,387 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2021-12-18 21:15:26,387 INFO L471 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) [2021-12-18 21:15:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2021-12-18 21:15:26,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-18 21:15:26,388 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:26,388 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:26,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2021-12-18 21:15:26,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:26,595 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1507930724, now seen corresponding path program 1 times [2021-12-18 21:15:26,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:26,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402778035] [2021-12-18 21:15:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:26,596 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:26,597 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) [2021-12-18 21:15:26,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-18 21:15:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:26,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 21:15:26,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:27,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:27,313 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:27,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402778035] [2021-12-18 21:15:27,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402778035] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:27,314 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:27,314 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:15:27,314 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580765144] [2021-12-18 21:15:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:27,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:15:27,315 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:27,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:15:27,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:15:27,316 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) [2021-12-18 21:15:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:27,686 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2021-12-18 21:15:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:15:27,687 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 [2021-12-18 21:15:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:27,687 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:15:27,687 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 21:15:27,688 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:27,688 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 207 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-12-18 21:15:27,689 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 432 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 189 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2021-12-18 21:15:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 21:15:27,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 113. [2021-12-18 21:15:27,691 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) [2021-12-18 21:15:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-18 21:15:27,692 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 65 [2021-12-18 21:15:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:27,692 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-18 21:15:27,692 INFO L471 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) [2021-12-18 21:15:27,692 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-18 21:15:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-18 21:15:27,693 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:27,693 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:27,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:27,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:27,906 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:27,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:27,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1701102758, now seen corresponding path program 1 times [2021-12-18 21:15:27,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:27,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242130291] [2021-12-18 21:15:27,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:27,907 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:27,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:27,908 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) [2021-12-18 21:15:27,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2021-12-18 21:15:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:28,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 86 conjunts are in the unsatisfiable core [2021-12-18 21:15:28,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:28,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:28,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:28,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:28,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:28,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:28,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:28,440 INFO L388 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 [2021-12-18 21:15:32,281 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2049 (_ BitVec 8)) (v_ArrVal_2051 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2051)))) is different from true [2021-12-18 21:15:32,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,295 INFO L388 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 [2021-12-18 21:15:32,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:32,620 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:15:32,620 INFO L388 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 72 treesize of output 50 [2021-12-18 21:15:32,864 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:15:32,864 INFO L388 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 [2021-12-18 21:15:33,076 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:33,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:33,077 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:33,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242130291] [2021-12-18 21:15:33,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242130291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:33,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:33,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-12-18 21:15:33,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594561318] [2021-12-18 21:15:33,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:33,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-18 21:15:33,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:33,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-18 21:15:33,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=641, Unknown=2, NotChecked=50, Total=756 [2021-12-18 21:15:33,079 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) [2021-12-18 21:15:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:33,884 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-12-18 21:15:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-18 21:15:33,886 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 [2021-12-18 21:15:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:33,887 INFO L225 Difference]: With dead ends: 101 [2021-12-18 21:15:33,887 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 21:15:33,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=136, Invalid=1198, Unknown=2, NotChecked=70, Total=1406 [2021-12-18 21:15:33,889 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:33,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 1113 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 327 Unchecked, 0.4s Time] [2021-12-18 21:15:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 21:15:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-12-18 21:15:33,893 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) [2021-12-18 21:15:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2021-12-18 21:15:33,893 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 68 [2021-12-18 21:15:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:33,893 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2021-12-18 21:15:33,894 INFO L471 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) [2021-12-18 21:15:33,894 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2021-12-18 21:15:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-12-18 21:15:33,894 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:33,895 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:33,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2021-12-18 21:15:34,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:34,107 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:34,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:34,108 INFO L85 PathProgramCache]: Analyzing trace with hash -756328715, now seen corresponding path program 1 times [2021-12-18 21:15:34,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:34,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594235941] [2021-12-18 21:15:34,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:34,108 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:34,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:34,109 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) [2021-12-18 21:15:34,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-18 21:15:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:34,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:15:34,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:34,395 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:34,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:15:34,860 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:34,861 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594235941] [2021-12-18 21:15:34,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594235941] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:15:34,861 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:15:34,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2021-12-18 21:15:34,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821207791] [2021-12-18 21:15:34,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:15:34,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:15:34,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:15:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:15:34,863 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) [2021-12-18 21:15:35,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:35,124 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2021-12-18 21:15:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 21:15:35,124 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 [2021-12-18 21:15:35,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:35,125 INFO L225 Difference]: With dead ends: 107 [2021-12-18 21:15:35,125 INFO L226 Difference]: Without dead ends: 107 [2021-12-18 21:15:35,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:15:35,126 INFO L933 BasicCegarLoop]: 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 [2021-12-18 21:15:35,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 363 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 47 Unchecked, 0.2s Time] [2021-12-18 21:15:35,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-12-18 21:15:35,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2021-12-18 21:15:35,128 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) [2021-12-18 21:15:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2021-12-18 21:15:35,129 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 70 [2021-12-18 21:15:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:35,129 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2021-12-18 21:15:35,129 INFO L471 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) [2021-12-18 21:15:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2021-12-18 21:15:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-18 21:15:35,130 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:35,130 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:35,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:35,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:35,339 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 681881017, now seen corresponding path program 1 times [2021-12-18 21:15:35,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:35,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016715295] [2021-12-18 21:15:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:35,341 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:35,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:35,341 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) [2021-12-18 21:15:35,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2021-12-18 21:15:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:35,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-18 21:15:35,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:35,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:35,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:15:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:36,164 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:36,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016715295] [2021-12-18 21:15:36,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016715295] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:15:36,165 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:15:36,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2021-12-18 21:15:36,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754434570] [2021-12-18 21:15:36,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:15:36,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-18 21:15:36,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:36,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-18 21:15:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-18 21:15:36,167 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) [2021-12-18 21:15:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:36,489 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2021-12-18 21:15:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:15:36,489 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 [2021-12-18 21:15:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:36,490 INFO L225 Difference]: With dead ends: 106 [2021-12-18 21:15:36,490 INFO L226 Difference]: Without dead ends: 106 [2021-12-18 21:15:36,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2021-12-18 21:15:36,491 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:36,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 441 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 51 Unchecked, 0.3s Time] [2021-12-18 21:15:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-18 21:15:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2021-12-18 21:15:36,493 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) [2021-12-18 21:15:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2021-12-18 21:15:36,493 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 76 [2021-12-18 21:15:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:36,494 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-12-18 21:15:36,494 INFO L471 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) [2021-12-18 21:15:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2021-12-18 21:15:36,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-12-18 21:15:36,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:36,495 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:36,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2021-12-18 21:15:36,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:36,695 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:36,696 INFO L85 PathProgramCache]: Analyzing trace with hash 681881018, now seen corresponding path program 1 times [2021-12-18 21:15:36,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:36,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443775016] [2021-12-18 21:15:36,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:36,696 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:36,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:36,697 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) [2021-12-18 21:15:36,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-18 21:15:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:37,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 21:15:37,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:37,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-18 21:15:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 21:15:37,506 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:15:37,507 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:15:37,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443775016] [2021-12-18 21:15:37,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443775016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:15:37,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:15:37,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-18 21:15:37,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334011561] [2021-12-18 21:15:37,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:15:37,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-18 21:15:37,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:15:37,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-18 21:15:37,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 21:15:37,508 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) [2021-12-18 21:15:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:15:37,787 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2021-12-18 21:15:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:15:37,788 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 [2021-12-18 21:15:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:15:37,789 INFO L225 Difference]: With dead ends: 101 [2021-12-18 21:15:37,789 INFO L226 Difference]: Without dead ends: 101 [2021-12-18 21:15:37,789 INFO L932 BasicCegarLoop]: 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 [2021-12-18 21:15:37,789 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:15:37,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 513 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2021-12-18 21:15:37,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-18 21:15:37,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2021-12-18 21:15:37,792 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) [2021-12-18 21:15:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2021-12-18 21:15:37,792 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 76 [2021-12-18 21:15:37,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:15:37,793 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2021-12-18 21:15:37,793 INFO L471 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) [2021-12-18 21:15:37,793 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2021-12-18 21:15:37,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-18 21:15:37,794 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:15:37,794 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:15:37,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2021-12-18 21:15:38,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:15:38,007 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:15:38,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:15:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1200120414, now seen corresponding path program 1 times [2021-12-18 21:15:38,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:15:38,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190317921] [2021-12-18 21:15:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:15:38,008 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:15:38,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:15:38,009 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) [2021-12-18 21:15:38,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2021-12-18 21:15:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:15:38,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 122 conjunts are in the unsatisfiable core [2021-12-18 21:15:38,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:15:38,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:38,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:15:38,626 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:15:38,627 INFO L388 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 [2021-12-18 21:15:43,327 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2735 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2735)))) is different from true [2021-12-18 21:15:43,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,362 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:15:43,363 INFO L388 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 [2021-12-18 21:15:43,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:43,757 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:15:43,758 INFO L388 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 201 treesize of output 89 [2021-12-18 21:15:44,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:44,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:44,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:44,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:15:44,417 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:15:44,417 INFO L388 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 [2021-12-18 21:15:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-12-18 21:15:48,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:16:00,887 WARN L838 $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 |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv14 32))) (.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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (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))))) (= (_ bv1 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))))))) is different from false [2021-12-18 21:16:03,016 WARN L838 $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 |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv14 32))) (.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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (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))))) (= (_ bv1 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 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv2 32)) ((_ 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))))))) is different from false [2021-12-18 21:16:05,051 WARN L838 $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 |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv14 32))) (.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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (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))))) (= (_ bv1 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse12 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#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) .cse12)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv1 32)) ((_ extract 15 8) .cse12)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv2 32)) ((_ extract 23 16) .cse12)) (bvadd |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv3 32)) ((_ extract 31 24) .cse12)))) |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 [2021-12-18 21:16:07,140 WARN L838 $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 |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv14 32))) (.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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (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))))) (= (_ bv1 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 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv2 32))) (.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))))))) is different from false [2021-12-18 21:16:09,182 WARN L838 $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 |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv14 32))) (.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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (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))))) (= (_ bv1 32) (let ((.cse11 (select (store |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base| (let ((.cse17 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv15 32))) (.cse16 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv14 32))) (.cse15 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv13 32))) (.cse12 (select |c_#memory_int| |c_ldv_kobject_put_~kobj#1.base|)) (.cse13 (bvadd |c_ldv_kobject_put_~kobj#1.offset| (_ bv12 32)))) (let ((.cse14 (bvadd (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13)) (_ bv4294967295 32)))) (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 [2021-12-18 21:16:11,227 WARN L838 $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 |v_ULTIMATE.start_entry_point_~kobj~2#1.offset_BEFORE_CALL_6| (_ bv14 32))) (.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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (= (_ bv1 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 (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))))) (= (_ bv1 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 (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6)) (_ bv4294967295 32)))) (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 [2021-12-18 21:16:13,689 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:16:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190317921] [2021-12-18 21:16:13,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190317921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:16:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1625408648] [2021-12-18 21:16:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:16:13,690 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:16:13,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:16:13,691 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) [2021-12-18 21:16:13,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2021-12-18 21:16:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:16:15,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-18 21:16:15,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:16:15,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:15,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:16:15,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:16:15,277 INFO L388 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 [2021-12-18 21:16:18,013 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2733 (_ BitVec 8)) (v_ArrVal_2937 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2937)))) is different from true [2021-12-18 21:16:18,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,042 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:16:18,043 INFO L388 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 [2021-12-18 21:16:18,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,240 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:16:18,241 INFO L388 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 201 treesize of output 89 [2021-12-18 21:16:18,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:18,517 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:16:18,517 INFO L388 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 [2021-12-18 21:16:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2021-12-18 21:16:18,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:16:21,530 WARN L838 $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 (= (_ bv1 32) (let ((.cse0 (select |c_#memory_int| |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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (concat (concat (concat (select .cse6 .cse11) (select .cse6 .cse10)) (select .cse6 .cse9)) (select .cse6 .cse7)) (_ bv4294967295 32)))) (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)))))))) is different from false [2021-12-18 21:16:23,654 WARN L838 $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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (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))))) (= (_ bv1 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 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv2 32)) ((_ 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 .cse11 .cse1) (select .cse11 .cse2)) (select .cse11 .cse3)) (select .cse11 .cse4))))))) is different from false [2021-12-18 21:16:25,706 WARN L838 $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 (= (_ bv1 32) (let ((.cse0 (select (store |c_#memory_int| |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.base| (let ((.cse5 (bvadd (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|) |c_ldv_kobject_put_ldv_atomic_sub_return_#t~mem28#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 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv2 32)) ((_ 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)))) (not (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (concat (concat (concat (select .cse7 .cse12) (select .cse7 .cse11)) (select .cse7 .cse10)) (select .cse7 .cse8)) (_ bv4294967295 32)))) (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)))))))) is different from false [2021-12-18 21:16:27,756 WARN L838 $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 (= (_ bv1 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 |c_ldv_kobject_put_ldv_atomic_sub_return_~v#1.offset| (_ bv2 32))) (.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 (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|)) (bvneg |c_ldv_kobject_put_ldv_atomic_sub_return_~i#1|)))) (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)))) (not (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (concat (concat (concat (select .cse11 .cse16) (select .cse11 .cse15)) (select .cse11 .cse14)) (select .cse11 .cse12)) (_ bv4294967295 32)))) (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)))))))) is different from false [2021-12-18 21:16:29,814 WARN L838 $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 (= (_ bv1 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 (= (_ bv1 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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (concat (concat (concat (select .cse12 .cse17) (select .cse12 .cse16)) (select .cse12 .cse15)) (select .cse12 .cse13)) (_ bv4294967295 32)))) (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)))))))) is different from false [2021-12-18 21:16:31,849 WARN L838 $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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32))) (.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 (= (_ bv1 32) (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 (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 (= (_ bv1 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 (concat (concat (concat (select .cse12 .cse10) (select .cse12 .cse9)) (select .cse12 .cse8)) (select .cse12 .cse6)) (_ bv4294967295 32)))) (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)))))))) is different from false [2021-12-18 21:16:32,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1625408648] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:16:32,626 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:16:32,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2021-12-18 21:16:32,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648711346] [2021-12-18 21:16:32,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:16:32,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-18 21:16:32,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:16:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-18 21:16:32,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2114, Unknown=21, NotChecked=1470, Total=3782 [2021-12-18 21:16:32,629 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 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) [2021-12-18 21:16:35,528 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2733 (_ BitVec 8)) (v_ArrVal_2937 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2937)))) (exists ((v_ArrVal_2735 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_2735))))) is different from true [2021-12-18 21:16:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:16:57,269 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2021-12-18 21:16:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-12-18 21:16:57,270 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 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 [2021-12-18 21:16:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:16:57,270 INFO L225 Difference]: With dead ends: 101 [2021-12-18 21:16:57,270 INFO L226 Difference]: Without dead ends: 97 [2021-12-18 21:16:57,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 71.7s TimeCoverageRelationStatistics Valid=483, Invalid=4956, Unknown=23, NotChecked=2370, Total=7832 [2021-12-18 21:16:57,272 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 113 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:16:57,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 845 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 696 Invalid, 0 Unknown, 210 Unchecked, 1.4s Time] [2021-12-18 21:16:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-12-18 21:16:57,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2021-12-18 21:16:57,275 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) [2021-12-18 21:16:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2021-12-18 21:16:57,275 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 81 [2021-12-18 21:16:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:16:57,276 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2021-12-18 21:16:57,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 31 states have internal predecessors, (58), 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) [2021-12-18 21:16:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2021-12-18 21:16:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-18 21:16:57,276 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:16:57,277 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:16:57,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2021-12-18 21:16:57,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2021-12-18 21:16:57,692 WARN L452 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 [2021-12-18 21:16:57,692 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:16:57,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:16:57,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2126857693, now seen corresponding path program 1 times [2021-12-18 21:16:57,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:16:57,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844964115] [2021-12-18 21:16:57,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:16:57,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:16:57,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:16:57,694 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) [2021-12-18 21:16:57,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2021-12-18 21:16:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:16:58,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 164 conjunts are in the unsatisfiable core [2021-12-18 21:16:58,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:16:58,296 INFO L388 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 [2021-12-18 21:16:58,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,336 INFO L388 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 25 treesize of output 24 [2021-12-18 21:16:58,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,380 INFO L388 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 25 treesize of output 24 [2021-12-18 21:16:58,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,425 INFO L388 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 25 treesize of output 24 [2021-12-18 21:16:58,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,474 INFO L388 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 25 treesize of output 24 [2021-12-18 21:16:58,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,529 INFO L388 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 [2021-12-18 21:16:58,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,574 INFO L388 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 [2021-12-18 21:16:58,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,622 INFO L388 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 [2021-12-18 21:16:58,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,674 INFO L388 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 [2021-12-18 21:16:58,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,737 INFO L388 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 [2021-12-18 21:16:58,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,798 INFO L388 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 [2021-12-18 21:16:58,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,867 INFO L388 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 [2021-12-18 21:16:58,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,926 INFO L388 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 [2021-12-18 21:16:58,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:58,987 INFO L388 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 [2021-12-18 21:16:59,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,041 INFO L388 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 [2021-12-18 21:16:59,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,091 INFO L388 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 [2021-12-18 21:16:59,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:16:59,326 INFO L388 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 [2021-12-18 21:17:04,600 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3169 (_ BitVec 32)) (v_ArrVal_3172 (_ 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| v_ArrVal_3169) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3172)))) is different from true [2021-12-18 21:17:04,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,612 INFO L388 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 [2021-12-18 21:17:04,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:04,782 INFO L388 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 [2021-12-18 21:17:07,038 WARN L860 $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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32)) v_ArrVal_3178) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3179)))) is different from true [2021-12-18 21:17:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,086 INFO L388 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 [2021-12-18 21:17:07,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:07,261 INFO L388 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 [2021-12-18 21:17:07,360 INFO L388 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 [2021-12-18 21:17:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 21:17:07,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:17:08,755 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:17:08,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844964115] [2021-12-18 21:17:08,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844964115] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:17:08,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [401734757] [2021-12-18 21:17:08,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:17:08,756 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:17:08,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:17:08,757 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) [2021-12-18 21:17:08,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2021-12-18 21:17:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:17:09,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 160 conjunts are in the unsatisfiable core [2021-12-18 21:17:09,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:17:09,548 INFO L388 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 [2021-12-18 21:17:09,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,564 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:09,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,593 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:09,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,617 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:09,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,638 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:09,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,668 INFO L388 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 [2021-12-18 21:17:09,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,688 INFO L388 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 [2021-12-18 21:17:09,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,714 INFO L388 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 [2021-12-18 21:17:09,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,736 INFO L388 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 [2021-12-18 21:17:09,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,759 INFO L388 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 [2021-12-18 21:17:09,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,781 INFO L388 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 [2021-12-18 21:17:09,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,796 INFO L388 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 [2021-12-18 21:17:09,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,815 INFO L388 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 [2021-12-18 21:17:09,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,833 INFO L388 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 [2021-12-18 21:17:09,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,849 INFO L388 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 [2021-12-18 21:17:09,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,868 INFO L388 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 [2021-12-18 21:17:09,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:09,927 INFO L388 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 [2021-12-18 21:17:12,954 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3169 (_ BitVec 32)) (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| v_ArrVal_3169) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3411)))) is different from true [2021-12-18 21:17:12,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:12,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:12,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:12,968 INFO L388 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 [2021-12-18 21:17:13,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:13,038 INFO L388 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 [2021-12-18 21:17:15,141 WARN L860 $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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32)) v_ArrVal_3418) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3419)))) is different from true [2021-12-18 21:17:15,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:15,190 INFO L388 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 [2021-12-18 21:17:15,295 INFO L388 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 [2021-12-18 21:17:15,411 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:17:15,411 INFO L388 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 [2021-12-18 21:17:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 21:17:15,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:17:17,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [401734757] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:17:17,117 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:17:17,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45] total 51 [2021-12-18 21:17:17,117 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805638709] [2021-12-18 21:17:17,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:17:17,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-18 21:17:17,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:17:17,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-18 21:17:17,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3347, Unknown=5, NotChecked=476, Total=4032 [2021-12-18 21:17:17,119 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 52 states, 50 states have (on average 1.88) internal successors, (94), 49 states have internal predecessors, (94), 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) [2021-12-18 21:17:21,931 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3169 (_ BitVec 32)) (v_ArrVal_3172 (_ 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| v_ArrVal_3169) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3172)))) (exists ((v_ArrVal_3169 (_ BitVec 32)) (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| v_ArrVal_3169) (bvadd |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3411))))) is different from true [2021-12-18 21:17:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:17:29,337 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2021-12-18 21:17:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-12-18 21:17:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 1.88) internal successors, (94), 49 states have internal predecessors, (94), 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 82 [2021-12-18 21:17:29,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:17:29,338 INFO L225 Difference]: With dead ends: 96 [2021-12-18 21:17:29,338 INFO L226 Difference]: Without dead ends: 96 [2021-12-18 21:17:29,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 25.5s TimeCoverageRelationStatistics Valid=456, Invalid=7567, Unknown=7, NotChecked=900, Total=8930 [2021-12-18 21:17:29,340 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 137 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 399 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:17:29,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 757 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1471 Invalid, 0 Unknown, 399 Unchecked, 2.4s Time] [2021-12-18 21:17:29,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-12-18 21:17:29,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2021-12-18 21:17:29,342 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) [2021-12-18 21:17:29,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2021-12-18 21:17:29,343 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 82 [2021-12-18 21:17:29,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:17:29,343 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2021-12-18 21:17:29,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 1.88) internal successors, (94), 49 states have internal predecessors, (94), 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) [2021-12-18 21:17:29,343 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2021-12-18 21:17:29,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-18 21:17:29,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:17:29,344 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:17:29,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2021-12-18 21:17:29,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2021-12-18 21:17:29,762 WARN L452 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 [2021-12-18 21:17:29,762 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:17:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:17:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1508079198, now seen corresponding path program 1 times [2021-12-18 21:17:29,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:17:29,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801398794] [2021-12-18 21:17:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:17:29,763 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:17:29,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:17:29,764 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) [2021-12-18 21:17:29,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2021-12-18 21:17:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:17:30,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 164 conjunts are in the unsatisfiable core [2021-12-18 21:17:30,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:17:30,403 INFO L388 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 [2021-12-18 21:17:30,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,444 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:30,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,481 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:30,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,533 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:30,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,576 INFO L388 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 [2021-12-18 21:17:30,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,613 INFO L388 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 [2021-12-18 21:17:30,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,658 INFO L388 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 [2021-12-18 21:17:30,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,699 INFO L388 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 [2021-12-18 21:17:30,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,740 INFO L388 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 [2021-12-18 21:17:30,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,786 INFO L388 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 [2021-12-18 21:17:30,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,831 INFO L388 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 [2021-12-18 21:17:30,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,876 INFO L388 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 [2021-12-18 21:17:30,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,929 INFO L388 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 [2021-12-18 21:17:30,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:30,984 INFO L388 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 [2021-12-18 21:17:31,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,043 INFO L388 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 [2021-12-18 21:17:31,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,108 INFO L388 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 [2021-12-18 21:17:31,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:31,303 INFO L388 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 [2021-12-18 21:17:36,472 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3651 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3651)))) is different from true [2021-12-18 21:17:36,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,492 INFO L388 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 [2021-12-18 21:17:36,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:36,694 INFO L388 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 [2021-12-18 21:17:38,961 WARN L860 $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))) (= |c_#memory_$Pointer$.base| (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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32)) v_ArrVal_3661) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3662)))) is different from true [2021-12-18 21:17:39,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,017 INFO L388 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 [2021-12-18 21:17:39,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:39,214 INFO L388 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 [2021-12-18 21:17:39,327 INFO L388 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 [2021-12-18 21:17:39,461 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 21:17:39,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:17:40,736 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:17:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801398794] [2021-12-18 21:17:40,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801398794] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:17:40,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1920096756] [2021-12-18 21:17:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:17:40,736 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:17:40,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:17:40,737 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) [2021-12-18 21:17:40,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2021-12-18 21:17:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:17:41,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 160 conjunts are in the unsatisfiable core [2021-12-18 21:17:41,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:17:41,530 INFO L388 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 [2021-12-18 21:17:41,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,558 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:41,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,576 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:41,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,607 INFO L388 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 [2021-12-18 21:17:41,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,636 INFO L388 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 25 treesize of output 24 [2021-12-18 21:17:41,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,676 INFO L388 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 [2021-12-18 21:17:41,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,697 INFO L388 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 [2021-12-18 21:17:41,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,721 INFO L388 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 [2021-12-18 21:17:41,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,744 INFO L388 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 [2021-12-18 21:17:41,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,771 INFO L388 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 [2021-12-18 21:17:41,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,798 INFO L388 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 [2021-12-18 21:17:41,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,824 INFO L388 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 [2021-12-18 21:17:41,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,850 INFO L388 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 [2021-12-18 21:17:41,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,875 INFO L388 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 [2021-12-18 21:17:41,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,898 INFO L388 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 [2021-12-18 21:17:41,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,916 INFO L388 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 [2021-12-18 21:17:41,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:41,993 INFO L388 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 [2021-12-18 21:17:45,187 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3892 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3892)))) is different from true [2021-12-18 21:17:45,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,200 INFO L388 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 [2021-12-18 21:17:45,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:45,269 INFO L388 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 [2021-12-18 21:17:47,357 WARN L860 $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))) (= |c_#memory_$Pointer$.base| (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 |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv14 32)) v_ArrVal_3901) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3898)))) is different from true [2021-12-18 21:17:47,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:17:47,416 INFO L388 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 [2021-12-18 21:17:47,555 INFO L388 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 [2021-12-18 21:17:47,669 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:17:47,669 INFO L388 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 [2021-12-18 21:17:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 21:17:47,820 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:17:49,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1920096756] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:17:49,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:17:49,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47] total 53 [2021-12-18 21:17:49,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208332278] [2021-12-18 21:17:49,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:17:49,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2021-12-18 21:17:49,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:17:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2021-12-18 21:17:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3450, Unknown=5, NotChecked=484, Total=4160 [2021-12-18 21:17:49,412 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) [2021-12-18 21:17:53,182 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3892 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3892)))) (exists ((v_ArrVal_3650 (_ BitVec 32)) (v_ArrVal_3651 (_ 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 |c_LDV_INIT_LIST_HEAD_#in~list.offset| (_ bv4 32)) v_ArrVal_3651))))) is different from true [2021-12-18 21:18:00,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:00,347 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2021-12-18 21:18:00,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-12-18 21:18:00,347 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 [2021-12-18 21:18:00,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:00,348 INFO L225 Difference]: With dead ends: 92 [2021-12-18 21:18:00,348 INFO L226 Difference]: Without dead ends: 91 [2021-12-18 21:18:00,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 129 SyntacticMatches, 10 SemanticMatches, 80 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1835 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=392, Invalid=5473, Unknown=7, NotChecked=770, Total=6642 [2021-12-18 21:18:00,350 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 149 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 378 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:00,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 613 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1260 Invalid, 0 Unknown, 378 Unchecked, 2.0s Time] [2021-12-18 21:18:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-12-18 21:18:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2021-12-18 21:18:00,352 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) [2021-12-18 21:18:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2021-12-18 21:18:00,353 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 83 [2021-12-18 21:18:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:00,353 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2021-12-18 21:18:00,353 INFO L471 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) [2021-12-18 21:18:00,353 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2021-12-18 21:18:00,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-12-18 21:18:00,354 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:18:00,354 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:18:00,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:00,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:00,754 WARN L452 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 [2021-12-18 21:18:00,755 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2021-12-18 21:18:00,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:18:00,755 INFO L85 PathProgramCache]: Analyzing trace with hash 102095468, now seen corresponding path program 1 times [2021-12-18 21:18:00,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:18:00,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11415067] [2021-12-18 21:18:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:00,756 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:18:00,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:18:00,757 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) [2021-12-18 21:18:00,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2021-12-18 21:18:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:01,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 21:18:01,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:01,590 INFO L388 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 12 treesize of output 9 [2021-12-18 21:18:04,055 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-18 21:18:04,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:08,768 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:18:08,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11415067] [2021-12-18 21:18:08,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11415067] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:18:08,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [417427636] [2021-12-18 21:18:08,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:18:08,769 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:18:08,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:18:08,770 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) [2021-12-18 21:18:08,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2021-12-18 21:18:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:18:09,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 21:18:09,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:18:10,008 INFO L354 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2021-12-18 21:18:10,009 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2021-12-18 21:18:10,422 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-18 21:18:10,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:18:15,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [417427636] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:18:15,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:18:15,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2021-12-18 21:18:15,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006802871] [2021-12-18 21:18:15,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:18:15,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 21:18:15,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:18:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 21:18:15,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=773, Unknown=3, NotChecked=0, Total=870 [2021-12-18 21:18:15,009 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-18 21:18:15,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:18:15,173 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2021-12-18 21:18:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:18:15,174 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 90 [2021-12-18 21:18:15,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:18:15,174 INFO L225 Difference]: With dead ends: 90 [2021-12-18 21:18:15,174 INFO L226 Difference]: Without dead ends: 0 [2021-12-18 21:18:15,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 308 SyntacticMatches, 11 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 5 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=122, Invalid=997, Unknown=3, NotChecked=0, Total=1122 [2021-12-18 21:18:15,175 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 37 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:18:15,175 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 391 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 132 Unchecked, 0.1s Time] [2021-12-18 21:18:15,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-18 21:18:15,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-18 21:18:15,176 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) [2021-12-18 21:18:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-18 21:18:15,176 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2021-12-18 21:18:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:18:15,176 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-18 21:18:15,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 5.473684210526316) internal successors, (104), 19 states have internal predecessors, (104), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2021-12-18 21:18:15,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-18 21:18:15,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-18 21:18:15,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2021-12-18 21:18:15,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2021-12-18 21:18:15,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION (22 of 25 remaining) [2021-12-18 21:18:15,182 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION (21 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION (20 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION (19 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION (18 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION (17 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION (15 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION (14 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION (13 of 25 remaining) [2021-12-18 21:18:15,183 INFO L764 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION (12 of 25 remaining) [2021-12-18 21:18:15,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATION (11 of 25 remaining) [2021-12-18 21:18:15,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATION (10 of 25 remaining) [2021-12-18 21:18:15,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATION (9 of 25 remaining) [2021-12-18 21:18:15,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATION (8 of 25 remaining) [2021-12-18 21:18:15,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATION (7 of 25 remaining) [2021-12-18 21:18:15,184 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATION (6 of 25 remaining) [2021-12-18 21:18:15,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2021-12-18 21:18:15,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2021-12-18 21:18:15,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2021-12-18 21:18:15,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2021-12-18 21:18:15,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2021-12-18 21:18:15,185 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2021-12-18 21:18:15,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:15,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2021-12-18 21:18:15,591 WARN L452 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 [2021-12-18 21:18:15,594 INFO L732 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] [2021-12-18 21:18:15,595 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:18:15,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:18:15 BoogieIcfgContainer [2021-12-18 21:18:15,597 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:18:15,598 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:18:15,598 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:18:15,598 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:18:15,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:15:07" (3/4) ... [2021-12-18 21:18:15,600 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-18 21:18:15,607 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2021-12-18 21:18:15,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2021-12-18 21:18:15,608 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2021-12-18 21:18:15,620 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2021-12-18 21:18:15,620 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2021-12-18 21:18:15,621 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-12-18 21:18:15,621 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-18 21:18:15,666 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-18 21:18:15,667 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:18:15,668 INFO L158 Benchmark]: Toolchain (without parser) took 189473.84ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 40.4MB in the beginning and 45.4MB in the end (delta: -5.0MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,668 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 46.1MB. Free memory was 29.4MB in the beginning and 29.3MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:18:15,675 INFO L158 Benchmark]: CACSL2BoogieTranslator took 700.11ms. Allocated memory is still 56.6MB. Free memory was 40.2MB in the beginning and 34.6MB in the end (delta: 5.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.24ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 31.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,676 INFO L158 Benchmark]: Boogie Preprocessor took 63.61ms. Allocated memory is still 56.6MB. Free memory was 31.7MB in the beginning and 29.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,676 INFO L158 Benchmark]: RCFGBuilder took 589.01ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 49.1MB in the end (delta: -19.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,676 INFO L158 Benchmark]: TraceAbstraction took 187963.91ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 48.8MB in the beginning and 50.2MB in the end (delta: -1.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,676 INFO L158 Benchmark]: Witness Printer took 70.04ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 45.4MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-18 21:18:15,677 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.24ms. Allocated memory is still 46.1MB. Free memory was 29.4MB in the beginning and 29.3MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 700.11ms. Allocated memory is still 56.6MB. Free memory was 40.2MB in the beginning and 34.6MB in the end (delta: 5.6MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.24ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 31.7MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.61ms. Allocated memory is still 56.6MB. Free memory was 31.7MB in the beginning and 29.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 589.01ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 29.4MB in the beginning and 49.1MB in the end (delta: -19.7MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * TraceAbstraction took 187963.91ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 48.8MB in the beginning and 50.2MB in the end (delta: -1.4MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * Witness Printer took 70.04ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 45.4MB in the end (delta: 4.8MB). 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: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: 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: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 699]: 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: 187.9s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 55.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2773 SdHoareTripleChecker+Valid, 11.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2750 mSDsluCounter, 17034 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1664 IncrementalHoareTripleChecker+Unchecked, 14429 mSDsCounter, 382 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7858 IncrementalHoareTripleChecker+Invalid, 9904 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 382 mSolverCounterUnsat, 2605 mSDtfsCounter, 7858 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2515 GetRequests, 1823 SyntacticMatches, 45 SemanticMatches, 647 ConstructedPredicates, 26 IntricatePredicates, 5 DeprecatedPredicates, 6191 ImplicationChecksByTransitivity, 141.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=25, InterpolantAutomatonStates: 447, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 34 MinimizatonAttempts, 351 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 6.0s SatisfiabilityAnalysisTime, 113.6s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2000 ConstructedInterpolants, 250 QuantifiedInterpolants, 22145 SizeOfPredicates, 895 NumberOfNonLiveVariables, 11729 ConjunctsInSsa, 1524 ConjunctsInUnsatCore, 43 InterpolantComputations, 25 PerfectInterpolantSequences, 3229/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! [2021-12-18 21:18:15,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE