./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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_2-2.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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:59:20,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:59:20,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:59:20,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:59:20,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:59:20,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:59:20,451 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:59:20,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:59:20,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:59:20,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:59:20,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:59:20,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:59:20,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:59:20,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:59:20,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:59:20,469 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:59:20,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:59:20,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:59:20,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:59:20,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:59:20,482 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:59:20,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:59:20,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:59:20,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:59:20,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:59:20,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:59:20,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:59:20,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:59:20,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:59:20,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:59:20,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:59:20,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:59:20,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:59:20,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:59:20,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:59:20,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:59:20,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:59:20,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:59:20,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:59:20,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:59:20,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:59:20,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:59:20,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:59:20,534 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:59:20,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:59:20,534 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:59:20,535 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:59:20,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:59:20,536 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:59:20,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:59:20,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:59:20,537 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:59:20,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:59:20,538 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:59:20,538 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:59:20,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:59:20,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:59:20,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:59:20,539 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:59:20,539 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:59:20,539 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:59:20,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:59:20,540 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:59:20,540 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:59:20,540 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:59:20,540 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:59:20,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:59:20,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:59:20,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:59:20,541 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:59:20,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:59:20,542 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:59:20,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:59:20,542 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-07-20 05:59:20,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:59:20,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:59:20,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:59:20,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:59:20,797 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:59:20,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-20 05:59:20,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf8a454/5b2f683f2ba64d4b992c0f04fa055a29/FLAG674a9bff1 [2022-07-20 05:59:21,359 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:59:21,360 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-20 05:59:21,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf8a454/5b2f683f2ba64d4b992c0f04fa055a29/FLAG674a9bff1 [2022-07-20 05:59:21,680 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ccf8a454/5b2f683f2ba64d4b992c0f04fa055a29 [2022-07-20 05:59:21,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:59:21,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:59:21,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:21,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:59:21,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:59:21,687 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:21" (1/1) ... [2022-07-20 05:59:21,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ab91d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:21, skipping insertion in model container [2022-07-20 05:59:21,688 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:21" (1/1) ... [2022-07-20 05:59:21,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:59:21,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:59:22,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:22,130 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-20 05:59:22,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1e3a4bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:22, skipping insertion in model container [2022-07-20 05:59:22,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:22,132 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 05:59:22,134 INFO L158 Benchmark]: Toolchain (without parser) took 450.49ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 53.7MB in the beginning and 83.8MB in the end (delta: -30.1MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-20 05:59:22,135 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:59:22,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.73ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 53.5MB in the beginning and 83.8MB in the end (delta: -30.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-07-20 05:59:22,138 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 81.8MB. Free memory is still 44.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.73ms. Allocated memory was 81.8MB in the beginning and 113.2MB in the end (delta: 31.5MB). Free memory was 53.5MB in the beginning and 83.8MB in the end (delta: -30.3MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.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 beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:59:23,879 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:59:23,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:59:23,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:59:23,926 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:59:23,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:59:23,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:59:23,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:59:23,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:59:23,949 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:59:23,949 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:59:23,950 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:59:23,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:59:23,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:59:23,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:59:23,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:59:23,953 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:59:23,954 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:59:23,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:59:23,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:59:23,965 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:59:23,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:59:23,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:59:23,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:59:23,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:59:23,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:59:23,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:59:23,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:59:23,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:59:23,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:59:23,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:59:23,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:59:23,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:59:23,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:59:23,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:59:23,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:59:23,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:59:23,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:59:23,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:59:23,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:59:23,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:59:23,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:59:23,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:59:24,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:59:24,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:59:24,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:59:24,025 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:59:24,026 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:59:24,026 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:59:24,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:59:24,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:59:24,027 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:59:24,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:59:24,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:59:24,029 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:59:24,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:59:24,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:59:24,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:59:24,030 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:59:24,030 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:59:24,030 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:59:24,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:59:24,030 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:59:24,031 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:59:24,031 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:59:24,031 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:59:24,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:59:24,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:59:24,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:59:24,032 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:59:24,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:59:24,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:59:24,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:59:24,033 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:59:24,033 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:59:24,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:59:24,033 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 -> beb004be26a355c223f1a45515f5377c37b18fc46f09e77727f89b964ae9789d [2022-07-20 05:59:24,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:59:24,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:59:24,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:59:24,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:59:24,353 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:59:24,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-20 05:59:24,409 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736d77a06/46fd1712442144fc937f37a08c69a4fe/FLAGab1bc6cf4 [2022-07-20 05:59:24,936 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:59:24,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-2.i [2022-07-20 05:59:24,955 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736d77a06/46fd1712442144fc937f37a08c69a4fe/FLAGab1bc6cf4 [2022-07-20 05:59:25,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/736d77a06/46fd1712442144fc937f37a08c69a4fe [2022-07-20 05:59:25,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:59:25,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:59:25,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:25,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:59:25,447 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:59:25,447 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:25" (1/1) ... [2022-07-20 05:59:25,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee03d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:25, skipping insertion in model container [2022-07-20 05:59:25,449 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:59:25" (1/1) ... [2022-07-20 05:59:25,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:59:25,499 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:59:25,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:25,861 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 05:59:25,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:59:25,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:25,946 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:59:26,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:59:26,053 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:59:26,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26 WrapperNode [2022-07-20 05:59:26,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:59:26,055 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:59:26,055 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:59:26,055 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:59:26,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,143 INFO L137 Inliner]: procedures = 165, calls = 71, calls flagged for inlining = 23, calls inlined = 17, statements flattened = 120 [2022-07-20 05:59:26,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:59:26,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:59:26,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:59:26,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:59:26,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,191 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:59:26,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:59:26,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:59:26,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:59:26,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (1/1) ... [2022-07-20 05:59:26,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:59:26,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:59:26,242 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:59:26,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:59:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:59:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-20 05:59:26,284 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-20 05:59:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 05:59:26,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 05:59:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-20 05:59:26,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-20 05:59:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:59:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:59:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:59:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:59:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:59:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:59:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 05:59:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:59:26,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:59:26,446 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:59:26,447 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:59:26,787 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:59:26,792 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:59:26,793 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:59:26,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:59:26 BoogieIcfgContainer [2022-07-20 05:59:26,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:59:26,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:59:26,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:59:26,815 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:59:26,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:59:25" (1/3) ... [2022-07-20 05:59:26,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db71efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:59:26, skipping insertion in model container [2022-07-20 05:59:26,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:59:26" (2/3) ... [2022-07-20 05:59:26,817 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db71efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:59:26, skipping insertion in model container [2022-07-20 05:59:26,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:59:26" (3/3) ... [2022-07-20 05:59:26,823 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-2.i [2022-07-20 05:59:26,836 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:59:26,836 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-20 05:59:26,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:59:26,899 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@775fcc18, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@69d46f26 [2022-07-20 05:59:26,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-20 05:59:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:26,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:59:26,909 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:26,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:26,911 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:26,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1790059245, now seen corresponding path program 1 times [2022-07-20 05:59:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:26,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056103417] [2022-07-20 05:59:26,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:26,928 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:26,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:26,931 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:26,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:59:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:27,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:59:27,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:27,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:27,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:27,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:27,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056103417] [2022-07-20 05:59:27,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056103417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:27,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:27,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:59:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882150080] [2022-07-20 05:59:27,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:27,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:59:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:59:27,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:59:27,201 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 83 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) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:27,542 INFO L93 Difference]: Finished difference Result 153 states and 173 transitions. [2022-07-20 05:59:27,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:27,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-20 05:59:27,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:27,553 INFO L225 Difference]: With dead ends: 153 [2022-07-20 05:59:27,553 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 05:59:27,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:27,557 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 94 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 373 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 [2022-07-20 05:59:27,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 373 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:59:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 05:59:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 93. [2022-07-20 05:59:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 85 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:59:27,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2022-07-20 05:59:27,623 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 10 [2022-07-20 05:59:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:27,624 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2022-07-20 05:59:27,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2022-07-20 05:59:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:59:27,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:27,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:27,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:27,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:27,834 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:27,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1761430094, now seen corresponding path program 1 times [2022-07-20 05:59:27,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:27,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697556330] [2022-07-20 05:59:27,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:27,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:27,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:27,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:27,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:59:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:27,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:59:27,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:27,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:27,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:27,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697556330] [2022-07-20 05:59:27,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697556330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:27,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:27,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:59:27,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563302381] [2022-07-20 05:59:27,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:27,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:59:27,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:59:27,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:27,946 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:27,971 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-20 05:59:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:59:27,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-07-20 05:59:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:27,973 INFO L225 Difference]: With dead ends: 110 [2022-07-20 05:59:27,973 INFO L226 Difference]: Without dead ends: 110 [2022-07-20 05:59:27,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:27,975 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 17 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:27,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 385 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-20 05:59:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2022-07-20 05:59:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 83 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:59:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-20 05:59:27,984 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 10 [2022-07-20 05:59:27,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:27,985 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-20 05:59:27,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:27,985 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-20 05:59:27,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:59:27,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:27,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:27,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:28,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:28,195 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 342738302, now seen corresponding path program 1 times [2022-07-20 05:59:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589699573] [2022-07-20 05:59:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:28,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:28,198 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:59:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:28,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:59:28,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:28,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:28,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:28,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:28,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589699573] [2022-07-20 05:59:28,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589699573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:28,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:28,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:59:28,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252454599] [2022-07-20 05:59:28,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:28,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:28,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:28,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:28,388 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:28,813 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-20 05:59:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-20 05:59:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:28,818 INFO L225 Difference]: With dead ends: 128 [2022-07-20 05:59:28,818 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 05:59:28,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:28,819 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 69 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 465 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:28,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 465 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:59:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 05:59:28,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 90. [2022-07-20 05:59:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 82 states have internal predecessors, (90), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:59:28,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-20 05:59:28,835 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 11 [2022-07-20 05:59:28,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:28,835 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-20 05:59:28,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-20 05:59:28,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:59:28,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:28,836 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:28,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:29,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:29,046 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:29,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:29,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2034926041, now seen corresponding path program 1 times [2022-07-20 05:59:29,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:29,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054801046] [2022-07-20 05:59:29,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:29,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:29,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:29,048 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:29,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:59:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:29,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:59:29,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:29,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:29,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:29,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:29,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054801046] [2022-07-20 05:59:29,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054801046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:29,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:29,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:59:29,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033115595] [2022-07-20 05:59:29,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:29,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:59:29,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:29,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:59:29,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:29,136 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:29,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:29,165 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-07-20 05:59:29,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:59:29,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-20 05:59:29,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:29,166 INFO L225 Difference]: With dead ends: 109 [2022-07-20 05:59:29,166 INFO L226 Difference]: Without dead ends: 109 [2022-07-20 05:59:29,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:29,168 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 33 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:29,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 409 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-20 05:59:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2022-07-20 05:59:29,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 82 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:59:29,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2022-07-20 05:59:29,175 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 12 [2022-07-20 05:59:29,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:29,176 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2022-07-20 05:59:29,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2022-07-20 05:59:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:59:29,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:29,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:29,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:29,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:29,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:29,387 INFO L85 PathProgramCache]: Analyzing trace with hash -517230920, now seen corresponding path program 1 times [2022-07-20 05:59:29,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:29,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975412144] [2022-07-20 05:59:29,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:29,389 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:29,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 05:59:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:29,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:59:29,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:29,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:29,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:29,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975412144] [2022-07-20 05:59:29,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975412144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:29,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:29,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:59:29,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883974869] [2022-07-20 05:59:29,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:29,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:59:29,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:29,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:59:29,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:29,503 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:29,537 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-07-20 05:59:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:59:29,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-07-20 05:59:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:29,539 INFO L225 Difference]: With dead ends: 106 [2022-07-20 05:59:29,539 INFO L226 Difference]: Without dead ends: 106 [2022-07-20 05:59:29,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:59:29,540 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 15 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:29,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-20 05:59:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2022-07-20 05:59:29,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.4918032786885247) internal successors, (91), 84 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:59:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2022-07-20 05:59:29,548 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 12 [2022-07-20 05:59:29,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:29,548 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2022-07-20 05:59:29,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:29,549 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2022-07-20 05:59:29,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 05:59:29,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:29,550 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:29,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:29,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:29,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:29,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:29,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1400250303, now seen corresponding path program 1 times [2022-07-20 05:59:29,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:29,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140090625] [2022-07-20 05:59:29,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:29,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:29,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:29,761 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:29,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:59:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:29,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:59:29,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:29,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:29,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:29,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140090625] [2022-07-20 05:59:29,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140090625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:29,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:29,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:59:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088848804] [2022-07-20 05:59:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:29,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:59:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:29,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:59:29,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:29,845 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:29,867 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-20 05:59:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:59:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-07-20 05:59:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:29,868 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:59:29,868 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:59:29,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:29,871 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 31 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:29,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 200 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:59:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-07-20 05:59:29,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 85 states have internal predecessors, (92), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:59:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-20 05:59:29,888 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 16 [2022-07-20 05:59:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:29,888 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-20 05:59:29,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-20 05:59:29,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:59:29,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:29,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:29,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:30,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:30,103 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1200886583, now seen corresponding path program 1 times [2022-07-20 05:59:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359597003] [2022-07-20 05:59:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:30,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:30,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:30,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:59:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:30,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:59:30,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:30,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:30,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:30,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359597003] [2022-07-20 05:59:30,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359597003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:30,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:30,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:59:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532202005] [2022-07-20 05:59:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:30,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:59:30,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:30,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:59:30,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:59:30,239 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:30,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:30,307 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2022-07-20 05:59:30,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:30,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 17 [2022-07-20 05:59:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:30,309 INFO L225 Difference]: With dead ends: 106 [2022-07-20 05:59:30,309 INFO L226 Difference]: Without dead ends: 106 [2022-07-20 05:59:30,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:59:30,310 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 14 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 448 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 [2022-07-20 05:59:30,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 448 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:30,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-20 05:59:30,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2022-07-20 05:59:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.4477611940298507) internal successors, (97), 91 states have internal predecessors, (97), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:59:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-07-20 05:59:30,316 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 17 [2022-07-20 05:59:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:30,316 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-07-20 05:59:30,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-07-20 05:59:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:59:30,317 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:30,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:30,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:30,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:30,532 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:30,532 INFO L85 PathProgramCache]: Analyzing trace with hash -517345560, now seen corresponding path program 1 times [2022-07-20 05:59:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:30,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [288627271] [2022-07-20 05:59:30,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:30,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:30,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:30,536 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:30,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:59:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:30,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:59:30,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:30,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:30,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:30,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:30,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [288627271] [2022-07-20 05:59:30,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [288627271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:30,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:30,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 05:59:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385494964] [2022-07-20 05:59:30,687 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:59:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:30,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:59:30,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:59:30,688 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:30,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:30,755 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-07-20 05:59:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:30,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-20 05:59:30,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:30,757 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:59:30,757 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:59:30,757 INFO L412 NwaCegarLoop]: 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 [2022-07-20 05:59:30,757 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 62 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:30,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 465 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:30,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:59:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-20 05:59:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 94 states have internal predecessors, (100), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:59:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2022-07-20 05:59:30,762 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2022-07-20 05:59:30,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:30,763 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2022-07-20 05:59:30,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:30,771 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-07-20 05:59:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:59:30,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:30,772 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:30,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-20 05:59:30,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:30,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:30,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -613690879, now seen corresponding path program 2 times [2022-07-20 05:59:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500370653] [2022-07-20 05:59:30,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:59:30,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:30,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:30,984 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:30,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 05:59:31,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:59:31,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:59:31,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:59:31,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:31,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 05:59:31,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:31,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500370653] [2022-07-20 05:59:31,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500370653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:31,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:31,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:31,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419663293] [2022-07-20 05:59:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:59:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:59:31,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:59:31,135 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:31,479 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-07-20 05:59:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:59:31,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-20 05:59:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:31,480 INFO L225 Difference]: With dead ends: 136 [2022-07-20 05:59:31,480 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 05:59:31,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:59:31,481 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 91 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 511 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 [2022-07-20 05:59:31,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 511 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:59:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 05:59:31,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 103. [2022-07-20 05:59:31,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 93 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:59:31,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-07-20 05:59:31,487 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 20 [2022-07-20 05:59:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:31,487 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-07-20 05:59:31,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-07-20 05:59:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:59:31,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:31,488 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:31,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:31,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:31,696 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:31,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash -613690878, now seen corresponding path program 1 times [2022-07-20 05:59:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:31,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624371367] [2022-07-20 05:59:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:31,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:31,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:31,698 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:31,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 05:59:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:59:31,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:31,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:31,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:31,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624371367] [2022-07-20 05:59:31,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624371367] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:31,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:31,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 05:59:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306952456] [2022-07-20 05:59:31,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:31,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:59:31,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:31,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:59:31,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:31,986 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:32,234 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2022-07-20 05:59:32,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:32,235 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-20 05:59:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:32,237 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:59:32,237 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:59:32,239 INFO L412 NwaCegarLoop]: 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 [2022-07-20 05:59:32,239 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:32,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 918 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:59:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:59:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-20 05:59:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.381578947368421) internal successors, (105), 99 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:59:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2022-07-20 05:59:32,244 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 20 [2022-07-20 05:59:32,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:32,244 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2022-07-20 05:59:32,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:32,245 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2022-07-20 05:59:32,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:59:32,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:32,245 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:32,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:32,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,446 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:32,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:32,446 INFO L85 PathProgramCache]: Analyzing trace with hash -694582635, now seen corresponding path program 1 times [2022-07-20 05:59:32,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:32,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52901509] [2022-07-20 05:59:32,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:32,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:32,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:32,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 05:59:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:32,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:59:32,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:59:32,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:32,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52901509] [2022-07-20 05:59:32,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52901509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:32,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:59:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588005781] [2022-07-20 05:59:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:32,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:59:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:59:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:32,548 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:59:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:32,665 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2022-07-20 05:59:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:59:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 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 25 [2022-07-20 05:59:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:32,667 INFO L225 Difference]: With dead ends: 115 [2022-07-20 05:59:32,667 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:59:32,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:59:32,668 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 31 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:32,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 182 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:59:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:59:32,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2022-07-20 05:59:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 88 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-07-20 05:59:32,671 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 25 [2022-07-20 05:59:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:32,671 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-07-20 05:59:32,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:59:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-07-20 05:59:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:59:32,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:32,672 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:32,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:32,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:32,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1800263842, now seen corresponding path program 2 times [2022-07-20 05:59:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:32,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394104131] [2022-07-20 05:59:32,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:59:32,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:32,875 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:32,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 05:59:32,945 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:59:32,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:59:32,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:59:32,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:32,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-20 05:59:33,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:33,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:33,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394104131] [2022-07-20 05:59:33,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394104131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:33,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:33,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:59:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474991582] [2022-07-20 05:59:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:33,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:33,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:33,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:33,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:33,120 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:33,578 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-20 05:59:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-20 05:59:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:33,580 INFO L225 Difference]: With dead ends: 135 [2022-07-20 05:59:33,580 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 05:59:33,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:33,581 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 97 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:33,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 590 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:59:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 05:59:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2022-07-20 05:59:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 87 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-20 05:59:33,584 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 26 [2022-07-20 05:59:33,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:33,584 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-20 05:59:33,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:33,584 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-20 05:59:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:59:33,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:33,585 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:33,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:33,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:33,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash -819776159, now seen corresponding path program 1 times [2022-07-20 05:59:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:33,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483287582] [2022-07-20 05:59:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:33,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:33,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:33,797 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:33,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 05:59:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:33,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:59:33,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:34,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:59:34,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:34,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483287582] [2022-07-20 05:59:34,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483287582] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:34,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:34,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-20 05:59:34,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376068089] [2022-07-20 05:59:34,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:34,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 05:59:34,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:34,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 05:59:34,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:59:34,468 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:34,836 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-20 05:59:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 05:59:34,837 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-20 05:59:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:34,838 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:59:34,838 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:59:34,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:59:34,839 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 29 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:34,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1126 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:59:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:59:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-20 05:59:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.375) internal successors, (99), 93 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-20 05:59:34,842 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 28 [2022-07-20 05:59:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:34,842 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-20 05:59:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 26 states have internal predecessors, (40), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-20 05:59:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:59:34,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:34,846 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:34,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:35,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:35,047 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1570464767, now seen corresponding path program 2 times [2022-07-20 05:59:35,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:35,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202600954] [2022-07-20 05:59:35,048 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:59:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:35,049 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:35,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 05:59:35,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:59:35,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:59:35,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:59:35,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:35,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:35,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202600954] [2022-07-20 05:59:35,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202600954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:35,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:35,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:59:35,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432129185] [2022-07-20 05:59:35,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:35,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:59:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:59:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:59:35,192 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:35,228 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-20 05:59:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:59:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-20 05:59:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:35,229 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:59:35,230 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:59:35,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:35,231 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:35,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 365 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:35,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:59:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-20 05:59:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 93 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:35,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-20 05:59:35,234 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 34 [2022-07-20 05:59:35,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:35,234 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-20 05:59:35,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:35,235 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-20 05:59:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:59:35,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:35,235 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:35,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:35,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:35,445 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:35,445 INFO L85 PathProgramCache]: Analyzing trace with hash -234355352, now seen corresponding path program 1 times [2022-07-20 05:59:35,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:35,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949165848] [2022-07-20 05:59:35,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:35,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:35,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:35,447 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:35,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 05:59:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:35,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:59:35,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:35,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:35,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:35,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:35,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949165848] [2022-07-20 05:59:35,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949165848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:35,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:35,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:59:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681902645] [2022-07-20 05:59:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:35,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:35,707 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:35,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:35,982 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2022-07-20 05:59:35,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:35,982 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-20 05:59:35,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:35,983 INFO L225 Difference]: With dead ends: 98 [2022-07-20 05:59:35,983 INFO L226 Difference]: Without dead ends: 98 [2022-07-20 05:59:35,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:35,984 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 74 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:35,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 378 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:59:35,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-20 05:59:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-20 05:59:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 91 states have internal predecessors, (96), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-20 05:59:35,987 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 36 [2022-07-20 05:59:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:35,987 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-20 05:59:35,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:35,987 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-20 05:59:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:59:35,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:35,988 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:36,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:36,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:36,189 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:36,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:36,189 INFO L85 PathProgramCache]: Analyzing trace with hash -234355351, now seen corresponding path program 1 times [2022-07-20 05:59:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:36,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774327806] [2022-07-20 05:59:36,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:36,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:36,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:36,191 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:36,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 05:59:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:36,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:59:36,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:36,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:36,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:36,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:36,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774327806] [2022-07-20 05:59:36,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774327806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:36,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:36,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:59:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137411785] [2022-07-20 05:59:36,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:36,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:59:36,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:59:36,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:59:36,565 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:36,857 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2022-07-20 05:59:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:59:36,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-20 05:59:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:36,858 INFO L225 Difference]: With dead ends: 96 [2022-07-20 05:59:36,858 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 05:59:36,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:36,859 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 78 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:36,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 460 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:59:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 05:59:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-20 05:59:36,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 89 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-20 05:59:36,862 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 36 [2022-07-20 05:59:36,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:36,863 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-20 05:59:36,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-20 05:59:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:59:36,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:36,864 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:36,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:37,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:37,075 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:37,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash -285061459, now seen corresponding path program 1 times [2022-07-20 05:59:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:37,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650695829] [2022-07-20 05:59:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:37,077 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:37,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 05:59:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:37,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:59:37,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:37,314 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:37,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:37,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:37,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650695829] [2022-07-20 05:59:37,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650695829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:37,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:37,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:37,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692324502] [2022-07-20 05:59:37,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:37,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:37,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:37,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:37,318 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:37,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:37,368 INFO L93 Difference]: Finished difference Result 96 states and 101 transitions. [2022-07-20 05:59:37,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:37,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-20 05:59:37,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:37,369 INFO L225 Difference]: With dead ends: 96 [2022-07-20 05:59:37,369 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 05:59:37,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:37,370 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 69 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:37,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 390 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 05:59:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-20 05:59:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 88 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:37,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2022-07-20 05:59:37,376 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2022-07-20 05:59:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:37,377 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2022-07-20 05:59:37,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:59:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2022-07-20 05:59:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 05:59:37,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:37,379 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:37,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:37,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:37,580 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1910239882, now seen corresponding path program 1 times [2022-07-20 05:59:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:37,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24821778] [2022-07-20 05:59:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:37,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:37,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:37,583 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:37,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 05:59:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:37,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 05:59:37,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:37,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:37,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:37,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:37,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24821778] [2022-07-20 05:59:37,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24821778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:37,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:37,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:59:37,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694943316] [2022-07-20 05:59:37,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:37,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:37,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:37,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:37,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:37,916 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:38,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:38,166 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-07-20 05:59:38,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-20 05:59:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:38,168 INFO L225 Difference]: With dead ends: 97 [2022-07-20 05:59:38,168 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 05:59:38,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:38,169 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 61 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:38,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 366 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 21 Unchecked, 0.2s Time] [2022-07-20 05:59:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 05:59:38,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-20 05:59:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 86 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-20 05:59:38,172 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2022-07-20 05:59:38,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:38,172 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-20 05:59:38,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:38,172 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-20 05:59:38,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 05:59:38,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:38,172 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:38,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:38,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:38,384 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1910239883, now seen corresponding path program 1 times [2022-07-20 05:59:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:38,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951660125] [2022-07-20 05:59:38,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:38,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:38,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:38,387 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:38,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 05:59:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:38,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:59:38,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:38,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:38,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:38,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:38,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951660125] [2022-07-20 05:59:38,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951660125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:38,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:38,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:59:38,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289511245] [2022-07-20 05:59:38,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:38,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:59:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:38,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:59:38,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:59:38,824 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:39,099 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-20 05:59:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:59:39,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-20 05:59:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:39,100 INFO L225 Difference]: With dead ends: 99 [2022-07-20 05:59:39,101 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 05:59:39,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:39,101 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 64 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:39,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 349 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2022-07-20 05:59:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 05:59:39,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2022-07-20 05:59:39,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 84 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:39,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2022-07-20 05:59:39,104 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 44 [2022-07-20 05:59:39,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:39,104 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2022-07-20 05:59:39,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:39,104 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2022-07-20 05:59:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:59:39,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:39,105 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:39,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:39,317 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:39,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:39,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1609523877, now seen corresponding path program 1 times [2022-07-20 05:59:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:39,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396439618] [2022-07-20 05:59:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:39,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:39,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:39,319 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:39,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 05:59:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:39,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:59:39,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:39,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:39,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:39,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396439618] [2022-07-20 05:59:39,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396439618] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:39,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:39,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:59:39,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170359814] [2022-07-20 05:59:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:39,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:59:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:59:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:59:39,568 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:39,615 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-07-20 05:59:39,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:59:39,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 49 [2022-07-20 05:59:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:39,616 INFO L225 Difference]: With dead ends: 92 [2022-07-20 05:59:39,616 INFO L226 Difference]: Without dead ends: 92 [2022-07-20 05:59:39,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:39,618 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 36 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:39,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 388 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:59:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-20 05:59:39,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-20 05:59:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.2222222222222223) internal successors, (88), 84 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-07-20 05:59:39,629 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 49 [2022-07-20 05:59:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:39,630 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-07-20 05:59:39,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-07-20 05:59:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 05:59:39,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:39,631 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:39,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:39,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:39,843 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:39,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1068375809, now seen corresponding path program 1 times [2022-07-20 05:59:39,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:39,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647565396] [2022-07-20 05:59:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:39,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:39,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:39,845 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:39,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 05:59:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:40,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 05:59:40,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:40,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:40,265 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:40,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:40,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647565396] [2022-07-20 05:59:40,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647565396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:40,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:40,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 05:59:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507000458] [2022-07-20 05:59:40,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:40,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 05:59:40,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 05:59:40,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:59:40,266 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:40,578 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2022-07-20 05:59:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:40,579 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 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 55 [2022-07-20 05:59:40,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:40,580 INFO L225 Difference]: With dead ends: 122 [2022-07-20 05:59:40,580 INFO L226 Difference]: Without dead ends: 122 [2022-07-20 05:59:40,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:59:40,581 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 174 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:40,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 312 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 19 Unchecked, 0.3s Time] [2022-07-20 05:59:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-20 05:59:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 107. [2022-07-20 05:59:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 98 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:59:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-07-20 05:59:40,586 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 55 [2022-07-20 05:59:40,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:40,587 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-07-20 05:59:40,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-07-20 05:59:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 05:59:40,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:40,588 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:40,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:40,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:40,800 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:40,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1068375808, now seen corresponding path program 1 times [2022-07-20 05:59:40,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:40,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116750218] [2022-07-20 05:59:40,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:40,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:40,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:40,802 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:40,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 05:59:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:41,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 05:59:41,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:41,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:41,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:41,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:41,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116750218] [2022-07-20 05:59:41,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116750218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:41,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:41,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:59:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426662363] [2022-07-20 05:59:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:41,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:59:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:59:41,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:41,359 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:41,728 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-20 05:59:41,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 05:59:41,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 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 55 [2022-07-20 05:59:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:41,732 INFO L225 Difference]: With dead ends: 109 [2022-07-20 05:59:41,732 INFO L226 Difference]: Without dead ends: 109 [2022-07-20 05:59:41,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:59:41,732 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:41,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 377 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 8 Unchecked, 0.3s Time] [2022-07-20 05:59:41,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-20 05:59:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-07-20 05:59:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.1744186046511629) internal successors, (101), 96 states have internal predecessors, (101), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:59:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-20 05:59:41,736 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 55 [2022-07-20 05:59:41,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:41,736 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-20 05:59:41,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-20 05:59:41,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 05:59:41,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:41,737 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:41,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:41,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:41,947 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash 7191578, now seen corresponding path program 1 times [2022-07-20 05:59:41,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:41,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1685832030] [2022-07-20 05:59:41,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:41,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:41,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:41,949 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:41,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 05:59:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:42,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:59:42,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:42,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:42,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:42,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1685832030] [2022-07-20 05:59:42,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1685832030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:42,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:42,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:59:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318251617] [2022-07-20 05:59:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:42,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:59:42,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:42,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:59:42,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:59:42,308 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:59:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:42,399 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2022-07-20 05:59:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:59:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 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 60 [2022-07-20 05:59:42,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:42,401 INFO L225 Difference]: With dead ends: 109 [2022-07-20 05:59:42,401 INFO L226 Difference]: Without dead ends: 105 [2022-07-20 05:59:42,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:42,402 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 62 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:42,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 445 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:59:42,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-20 05:59:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-20 05:59:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 96 states have internal predecessors, (99), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:59:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2022-07-20 05:59:42,406 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 60 [2022-07-20 05:59:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:42,406 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2022-07-20 05:59:42,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:59:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-07-20 05:59:42,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 05:59:42,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:42,407 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:42,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:42,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:42,620 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:42,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash 392980163, now seen corresponding path program 1 times [2022-07-20 05:59:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:42,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923155475] [2022-07-20 05:59:42,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:42,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:42,622 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:42,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-20 05:59:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:42,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:59:42,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:42,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:43,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:43,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:43,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923155475] [2022-07-20 05:59:43,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923155475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:43,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:43,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:59:43,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726802564] [2022-07-20 05:59:43,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:43,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:59:43,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:43,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:59:43,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:59:43,117 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:43,406 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2022-07-20 05:59:43,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:43,407 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 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 61 [2022-07-20 05:59:43,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:43,407 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:59:43,407 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:59:43,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:59:43,408 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 110 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:43,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 326 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-20 05:59:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:59:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2022-07-20 05:59:43,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.1494252873563218) internal successors, (100), 96 states have internal predecessors, (100), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:59:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-07-20 05:59:43,412 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 61 [2022-07-20 05:59:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:43,412 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-07-20 05:59:43,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 10 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-07-20 05:59:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 05:59:43,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:43,414 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:43,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:43,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:43,626 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:43,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:43,626 INFO L85 PathProgramCache]: Analyzing trace with hash 392980164, now seen corresponding path program 1 times [2022-07-20 05:59:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:43,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654884369] [2022-07-20 05:59:43,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:43,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:43,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:43,628 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:43,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-20 05:59:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:43,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 05:59:43,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:43,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:44,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:44,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:44,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654884369] [2022-07-20 05:59:44,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654884369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:44,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:44,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 05:59:44,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766433862] [2022-07-20 05:59:44,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:44,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:59:44,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:44,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:59:44,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:44,246 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:44,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:44,717 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-07-20 05:59:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:44,718 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 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 61 [2022-07-20 05:59:44,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:44,719 INFO L225 Difference]: With dead ends: 103 [2022-07-20 05:59:44,719 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 05:59:44,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:59:44,719 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 146 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:44,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 377 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 8 Unchecked, 0.3s Time] [2022-07-20 05:59:44,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 05:59:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-20 05:59:44,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.1149425287356323) internal successors, (97), 94 states have internal predecessors, (97), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:59:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2022-07-20 05:59:44,723 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 61 [2022-07-20 05:59:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:44,723 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2022-07-20 05:59:44,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-07-20 05:59:44,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-20 05:59:44,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:44,724 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:44,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:44,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:44,945 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash -808735445, now seen corresponding path program 1 times [2022-07-20 05:59:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:44,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683809857] [2022-07-20 05:59:44,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:44,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:44,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:44,947 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:44,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-20 05:59:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:45,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 05:59:45,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:45,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:45,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:45,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683809857] [2022-07-20 05:59:45,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683809857] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:45,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:45,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:59:45,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636586979] [2022-07-20 05:59:45,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:45,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:59:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:59:45,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:45,647 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:45,977 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2022-07-20 05:59:45,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:59:45,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 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 64 [2022-07-20 05:59:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:45,979 INFO L225 Difference]: With dead ends: 102 [2022-07-20 05:59:45,979 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:59:45,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:59:45,980 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 157 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:45,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 383 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 185 Invalid, 0 Unknown, 7 Unchecked, 0.2s Time] [2022-07-20 05:59:45,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:59:45,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-20 05:59:45,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 87 states have (on average 1.103448275862069) internal successors, (96), 93 states have internal predecessors, (96), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:59:45,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-07-20 05:59:45,984 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 64 [2022-07-20 05:59:45,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:45,984 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-07-20 05:59:45,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 10 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-07-20 05:59:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 05:59:45,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:45,985 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:45,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-20 05:59:46,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:46,196 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:46,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1477848750, now seen corresponding path program 1 times [2022-07-20 05:59:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:46,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952560199] [2022-07-20 05:59:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:46,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:46,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:46,198 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:46,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-20 05:59:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:46,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:59:46,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:46,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:46,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:46,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:46,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952560199] [2022-07-20 05:59:46,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952560199] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:46,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:46,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-20 05:59:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795952321] [2022-07-20 05:59:46,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:46,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:59:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:46,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:59:46,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:59:46,877 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:59:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:47,224 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2022-07-20 05:59:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:59:47,225 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 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 68 [2022-07-20 05:59:47,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:47,226 INFO L225 Difference]: With dead ends: 128 [2022-07-20 05:59:47,226 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 05:59:47,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-20 05:59:47,227 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 152 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:47,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 385 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 234 Invalid, 0 Unknown, 52 Unchecked, 0.3s Time] [2022-07-20 05:59:47,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 05:59:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2022-07-20 05:59:47,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.1020408163265305) internal successors, (108), 104 states have internal predecessors, (108), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 05:59:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-07-20 05:59:47,231 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 68 [2022-07-20 05:59:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:47,231 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-07-20 05:59:47,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:59:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-07-20 05:59:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 05:59:47,232 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:47,232 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:47,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-20 05:59:47,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:47,442 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1729031655, now seen corresponding path program 1 times [2022-07-20 05:59:47,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:47,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466850900] [2022-07-20 05:59:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:47,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:47,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:47,445 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:47,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-20 05:59:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:47,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-20 05:59:47,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:47,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:47,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:47,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:47,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:47,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:47,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:47,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 38 [2022-07-20 05:59:52,143 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2206 (_ BitVec 8)) (v_ArrVal_2208 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2206) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2208)) |c_#memory_int|)) is different from true [2022-07-20 05:59:52,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2022-07-20 05:59:52,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:52,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:59:52,471 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:59:52,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 69 [2022-07-20 05:59:52,661 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:59:52,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 23 [2022-07-20 05:59:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:52,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:59:52,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:52,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466850900] [2022-07-20 05:59:52,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466850900] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:59:52,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:59:52,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-07-20 05:59:52,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783724829] [2022-07-20 05:59:52,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:59:52,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-20 05:59:52,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:52,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-20 05:59:52,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=591, Unknown=2, NotChecked=48, Total=702 [2022-07-20 05:59:52,884 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:53,727 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2022-07-20 05:59:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:59:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 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 67 [2022-07-20 05:59:53,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:53,730 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:59:53,730 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:59:53,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=134, Invalid=1128, Unknown=2, NotChecked=68, Total=1332 [2022-07-20 05:59:53,731 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 324 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:53,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 934 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 253 Invalid, 0 Unknown, 324 Unchecked, 0.4s Time] [2022-07-20 05:59:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:59:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2022-07-20 05:59:53,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 87 states have internal predecessors, (90), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2022-07-20 05:59:53,740 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 67 [2022-07-20 05:59:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:53,740 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2022-07-20 05:59:53,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 24 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:59:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2022-07-20 05:59:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 05:59:53,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:53,742 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:53,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-20 05:59:53,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:53,947 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:53,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:53,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1342862122, now seen corresponding path program 1 times [2022-07-20 05:59:53,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:53,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104709347] [2022-07-20 05:59:53,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:53,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:53,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:53,950 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:53,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-20 05:59:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:54,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 05:59:54,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:54,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:59:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:54,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:59:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-20 05:59:54,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:59:54,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104709347] [2022-07-20 05:59:54,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104709347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:59:54,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:59:54,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-20 05:59:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029766371] [2022-07-20 05:59:54,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:59:54,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:59:54,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:59:54,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:59:54,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-20 05:59:54,747 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:59:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:59:55,148 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-20 05:59:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:59:55,148 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 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 74 [2022-07-20 05:59:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:59:55,149 INFO L225 Difference]: With dead ends: 102 [2022-07-20 05:59:55,149 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:59:55,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-07-20 05:59:55,150 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:59:55,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 414 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 241 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2022-07-20 05:59:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:59:55,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2022-07-20 05:59:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.072289156626506) internal successors, (89), 86 states have internal predecessors, (89), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:59:55,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-07-20 05:59:55,152 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 74 [2022-07-20 05:59:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:59:55,153 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-07-20 05:59:55,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 12 states have internal predecessors, (67), 3 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:59:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-07-20 05:59:55,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-20 05:59:55,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:59:55,153 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:59:55,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-20 05:59:55,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:59:55,367 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 05:59:55,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:59:55,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1943196067, now seen corresponding path program 1 times [2022-07-20 05:59:55,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:59:55,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022325156] [2022-07-20 05:59:55,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:59:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:59:55,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:59:55,370 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:59:55,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-20 05:59:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:59:55,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 114 conjunts are in the unsatisfiable core [2022-07-20 05:59:55,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:59:55,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:59:55,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:59:55,971 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:59:55,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-20 06:00:00,593 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2561 (_ BitVec 8)) (v_ArrVal_2564 (_ 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_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2564)))) is different from true [2022-07-20 06:00:00,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:00,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:00,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-20 06:00:01,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:01,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:01,012 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:01,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,014 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:01,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:01,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-20 06:00:01,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:01,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:01,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-20 06:00:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-07-20 06:00:06,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:00:30,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:00:30,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022325156] [2022-07-20 06:00:30,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022325156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:00:30,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2064622357] [2022-07-20 06:00:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:00:30,209 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:00:30,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:00:30,211 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:00:30,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-20 06:00:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:00:32,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-20 06:00:32,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:00:34,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:34,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:34,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:34,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2022-07-20 06:00:37,159 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2765 (_ BitVec 8)) (v_ArrVal_2561 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2765)) |c_#memory_int|)) is different from true [2022-07-20 06:00:37,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,186 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:37,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 71 [2022-07-20 06:00:37,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,317 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:37,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:37,319 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:37,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:00:37,330 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:37,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 193 treesize of output 165 [2022-07-20 06:00:37,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:00:37,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:00:37,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 249 treesize of output 137 [2022-07-20 06:00:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 06:00:37,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:00:39,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2064622357] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:00:39,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:00:39,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 43] total 44 [2022-07-20 06:00:39,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839179222] [2022-07-20 06:00:39,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:00:39,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-20 06:00:39,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:00:39,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-20 06:00:39,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3825, Unknown=13, NotChecked=250, Total=4290 [2022-07-20 06:00:39,746 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:00:43,907 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2561 (_ BitVec 8)) (v_ArrVal_2564 (_ 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_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2564)))) (exists ((v_ArrVal_2765 (_ BitVec 8)) (v_ArrVal_2561 (_ BitVec 8))) (= (store |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_int)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_2561) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2765)) |c_#memory_int|))) is different from true [2022-07-20 06:01:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:01:25,923 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2022-07-20 06:01:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-20 06:01:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 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 79 [2022-07-20 06:01:25,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:01:25,925 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:01:25,925 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 06:01:25,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 81.0s TimeCoverageRelationStatistics Valid=523, Invalid=7297, Unknown=24, NotChecked=528, Total=8372 [2022-07-20 06:01:25,927 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 121 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 240 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-20 06:01:25,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 898 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1282 Invalid, 0 Unknown, 240 Unchecked, 2.8s Time] [2022-07-20 06:01:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 06:01:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-20 06:01:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 86 states have internal predecessors, (88), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:01:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-20 06:01:25,931 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 79 [2022-07-20 06:01:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:01:25,931 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-20 06:01:25,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 41 states have internal predecessors, (69), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 06:01:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-20 06:01:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-20 06:01:25,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:01:25,932 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:01:25,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-20 06:01:26,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-20 06:01:26,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:01:26,350 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 06:01:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:01:26,350 INFO L85 PathProgramCache]: Analyzing trace with hash -826672710, now seen corresponding path program 1 times [2022-07-20 06:01:26,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:01:26,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317066702] [2022-07-20 06:01:26,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:01:26,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:01:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:01:26,358 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:01:26,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-20 06:01:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:01:26,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-20 06:01:26,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:01:26,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:01:26,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:26,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:27,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:27,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:27,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:27,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:27,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:27,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:27,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:27,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:01:32,383 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3001 (_ BitVec 32)) (v_ArrVal_2999 (_ 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_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3001)))) is different from true [2022-07-20 06:01:32,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-20 06:01:32,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:32,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:01:34,856 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3010 (_ BitVec 32)) (v_ArrVal_3009 (_ BitVec 32)) (v_ArrVal_3007 (_ BitVec 32)) (v_ArrVal_3008 (_ BitVec 32))) (= (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_3007) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3009) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3008) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3010)) |c_#memory_$Pointer$.offset|)) is different from true [2022-07-20 06:01:34,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:34,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:01:35,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:35,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-20 06:01:35,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:01:35,406 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 06:01:35,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:01:38,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:01:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317066702] [2022-07-20 06:01:38,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317066702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:01:38,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [115906526] [2022-07-20 06:01:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:01:38,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:01:38,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:01:38,224 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:01:38,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-20 06:01:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:01:39,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-20 06:01:39,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:01:39,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:01:39,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:01:39,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:01:39,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:39,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:01:43,196 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2999 (_ BitVec 32)) (v_ArrVal_3248 (_ 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_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3248)))) is different from true [2022-07-20 06:01:43,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-20 06:01:43,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:43,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:01:45,333 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3256 (_ BitVec 32)) (v_ArrVal_3257 (_ BitVec 32)) (v_ArrVal_3258 (_ BitVec 32)) (v_ArrVal_3259 (_ 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_3256) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3257) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3259) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3258)))) is different from true [2022-07-20 06:01:45,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:01:45,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:01:45,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-20 06:01:45,613 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:01:45,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-20 06:01:45,719 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 06:01:45,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:01:47,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [115906526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:01:47,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:01:47,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 50 [2022-07-20 06:01:47,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028216373] [2022-07-20 06:01:47,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:01:47,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 06:01:47,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:01:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 06:01:47,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3927, Unknown=5, NotChecked=516, Total=4692 [2022-07-20 06:01:47,193 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 06:01:52,002 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2999 (_ BitVec 32)) (v_ArrVal_3248 (_ 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_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3248)))) (exists ((v_ArrVal_3001 (_ BitVec 32)) (v_ArrVal_2999 (_ 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_2999) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3001))))) is different from true [2022-07-20 06:01:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:01:59,464 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-20 06:01:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-20 06:01:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 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 80 [2022-07-20 06:01:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:01:59,466 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:01:59,466 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:01:59,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 139 SyntacticMatches, 11 SemanticMatches, 97 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2283 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=520, Invalid=8235, Unknown=7, NotChecked=940, Total=9702 [2022-07-20 06:01:59,477 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 163 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 398 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:01:59,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 838 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1606 Invalid, 0 Unknown, 398 Unchecked, 2.6s Time] [2022-07-20 06:01:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:01:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-20 06:01:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.0481927710843373) internal successors, (87), 85 states have internal predecessors, (87), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:01:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-07-20 06:01:59,481 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 80 [2022-07-20 06:01:59,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:01:59,482 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-07-20 06:01:59,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.84) internal successors, (92), 48 states have internal predecessors, (92), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 06:01:59,482 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-07-20 06:01:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-20 06:01:59,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:01:59,483 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:01:59,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-20 06:01:59,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-20 06:01:59,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:01:59,911 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 06:01:59,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:01:59,912 INFO L85 PathProgramCache]: Analyzing trace with hash 142949917, now seen corresponding path program 1 times [2022-07-20 06:01:59,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:01:59,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940484648] [2022-07-20 06:01:59,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:01:59,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:01:59,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:01:59,914 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:01:59,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-20 06:02:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:00,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-20 06:02:00,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:00,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:02:00,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:00,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:00,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:00,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:00,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:00,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:00,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:00,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:00,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:00,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:01,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:01,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:01,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:01,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:01,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:01,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:01,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:02:06,912 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3489 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3489)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-20 06:02:06,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:06,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:06,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:06,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-20 06:02:07,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:07,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:02:09,365 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3498 (_ BitVec 32)) (v_ArrVal_3499 (_ BitVec 32)) (v_ArrVal_3496 (_ BitVec 32)) (v_ArrVal_3497 (_ 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_3498) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3499) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3496) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3497)))) is different from true [2022-07-20 06:02:09,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:02:09,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:09,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2022-07-20 06:02:09,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:02:09,952 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 06:02:09,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:12,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:02:12,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940484648] [2022-07-20 06:02:12,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940484648] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:12,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [956408768] [2022-07-20 06:02:12,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:12,905 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:02:12,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:02:12,908 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:02:12,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-20 06:02:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:13,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-20 06:02:13,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:13,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 06:02:13,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:13,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:13,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:13,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:13,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:13,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:13,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:13,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:14,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:14,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:14,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:14,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-20 06:02:14,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:14,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:14,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:02:14,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:14,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:02:17,680 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3736 (_ 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_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3736)))) is different from true [2022-07-20 06:02:17,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2022-07-20 06:02:17,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:17,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:02:19,827 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3746 (_ BitVec 32)) (v_ArrVal_3744 (_ BitVec 32)) (v_ArrVal_3745 (_ BitVec 32)) (v_ArrVal_3743 (_ 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_3746) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv13 32)) v_ArrVal_3744) (bvadd (_ bv14 32) |c_ldv_kobject_put_#in~kobj#1.offset|) v_ArrVal_3745) (bvadd |c_ldv_kobject_put_#in~kobj#1.offset| (_ bv15 32)) v_ArrVal_3743)))) is different from true [2022-07-20 06:02:19,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:02:19,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2022-07-20 06:02:19,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 39 [2022-07-20 06:02:20,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:02:20,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-20 06:02:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-20 06:02:20,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:21,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [956408768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:21,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:02:21,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46] total 52 [2022-07-20 06:02:21,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293302162] [2022-07-20 06:02:21,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:02:21,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-20 06:02:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:02:21,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-20 06:02:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4040, Unknown=5, NotChecked=524, Total=4830 [2022-07-20 06:02:21,786 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 06:02:25,873 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3489 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base| (store (store (select |c_old(#memory_$Pointer$.base)| |c_LDV_INIT_LIST_HEAD_#in~list.base|) |c_LDV_INIT_LIST_HEAD_#in~list.offset| v_ArrVal_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3489)) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3486 (_ BitVec 32)) (v_ArrVal_3736 (_ 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_3486) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_3736))))) is different from true [2022-07-20 06:02:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:33,513 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2022-07-20 06:02:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 06:02:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 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 81 [2022-07-20 06:02:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:33,514 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:02:33,514 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:02:33,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 142 SyntacticMatches, 11 SemanticMatches, 84 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1968 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=441, Invalid=6052, Unknown=7, NotChecked=810, Total=7310 [2022-07-20 06:02:33,516 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 141 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 367 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:33,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 603 Invalid, 1859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1422 Invalid, 0 Unknown, 367 Unchecked, 2.5s Time] [2022-07-20 06:02:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:02:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-20 06:02:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.0125) internal successors, (81), 80 states have internal predecessors, (81), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 06:02:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2022-07-20 06:02:33,519 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 81 [2022-07-20 06:02:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:33,519 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2022-07-20 06:02:33,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.7884615384615385) internal successors, (93), 49 states have internal predecessors, (93), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 06:02:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2022-07-20 06:02:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 06:02:33,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:02:33,520 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:33,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-07-20 06:02:33,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-20 06:02:33,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:02:33,939 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-20 06:02:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:02:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2138038455, now seen corresponding path program 1 times [2022-07-20 06:02:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:02:33,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583943494] [2022-07-20 06:02:33,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:33,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:02:33,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:02:33,942 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:02:33,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-20 06:02:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:34,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:02:34,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:34,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2022-07-20 06:02:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-20 06:02:35,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:40,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:02:40,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583943494] [2022-07-20 06:02:40,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [583943494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:40,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [501613668] [2022-07-20 06:02:40,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:02:40,212 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 06:02:40,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 06:02:40,213 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 06:02:40,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-07-20 06:02:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:02:41,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-20 06:02:41,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:02:41,552 INFO L356 Elim1Store]: treesize reduction 16, result has 42.9 percent of original size [2022-07-20 06:02:41,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-20 06:02:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-20 06:02:41,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:02:46,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [501613668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:02:46,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:02:46,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2022-07-20 06:02:46,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820979857] [2022-07-20 06:02:46,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:02:46,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 06:02:46,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:02:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 06:02:46,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=721, Unknown=2, NotChecked=0, Total=812 [2022-07-20 06:02:46,372 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-20 06:02:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:02:46,534 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2022-07-20 06:02:46,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:02:46,534 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 88 [2022-07-20 06:02:46,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:02:46,534 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:02:46,534 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 06:02:46,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 306 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 4 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=108, Invalid=820, Unknown=2, NotChecked=0, Total=930 [2022-07-20 06:02:46,535 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 179 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:02:46,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 490 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 179 Unchecked, 0.1s Time] [2022-07-20 06:02:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 06:02:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 06:02:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:02:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 06:02:46,536 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2022-07-20 06:02:46,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:02:46,536 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 06:02:46,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-20 06:02:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 06:02:46,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 06:02:46,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 25 remaining) [2022-07-20 06:02:46,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 25 remaining) [2022-07-20 06:02:46,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 25 remaining) [2022-07-20 06:02:46,539 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 25 remaining) [2022-07-20 06:02:46,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 25 remaining) [2022-07-20 06:02:46,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 25 remaining) [2022-07-20 06:02:46,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 25 remaining) [2022-07-20 06:02:46,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 25 remaining) [2022-07-20 06:02:46,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (16 of 25 remaining) [2022-07-20 06:02:46,540 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 25 remaining) [2022-07-20 06:02:46,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 25 remaining) [2022-07-20 06:02:46,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 25 remaining) [2022-07-20 06:02:46,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 25 remaining) [2022-07-20 06:02:46,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 25 remaining) [2022-07-20 06:02:46,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 25 remaining) [2022-07-20 06:02:46,541 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 25 remaining) [2022-07-20 06:02:46,542 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 25 remaining) [2022-07-20 06:02:46,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 25 remaining) [2022-07-20 06:02:46,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 25 remaining) [2022-07-20 06:02:46,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-07-20 06:02:46,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-07-20 06:02:46,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 06:02:46,962 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:02:46,964 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:02:46,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:02:46 BoogieIcfgContainer [2022-07-20 06:02:46,966 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:02:46,966 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:02:46,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:02:46,967 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:02:46,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:59:26" (3/4) ... [2022-07-20 06:02:46,969 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 06:02:46,975 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-20 06:02:46,975 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2022-07-20 06:02:46,975 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2022-07-20 06:02:46,982 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2022-07-20 06:02:46,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-20 06:02:46,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-20 06:02:46,984 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 06:02:47,037 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 06:02:47,037 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:02:47,038 INFO L158 Benchmark]: Toolchain (without parser) took 201599.41ms. Allocated memory was 52.4MB in the beginning and 81.8MB in the end (delta: 29.4MB). Free memory was 27.9MB in the beginning and 36.9MB in the end (delta: -8.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-20 06:02:47,038 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 52.4MB. Free memory was 33.7MB in the beginning and 33.7MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:02:47,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 610.45ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 27.8MB in the beginning and 32.7MB in the end (delta: -4.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-20 06:02:47,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.05ms. Allocated memory is still 67.1MB. Free memory was 32.7MB in the beginning and 47.8MB in the end (delta: -15.1MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-20 06:02:47,044 INFO L158 Benchmark]: Boogie Preprocessor took 60.59ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:02:47,046 INFO L158 Benchmark]: RCFGBuilder took 588.80ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 25.4MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-20 06:02:47,047 INFO L158 Benchmark]: TraceAbstraction took 200170.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 25.1MB in the beginning and 41.1MB in the end (delta: -15.9MB). Peak memory consumption was 220.7kB. Max. memory is 16.1GB. [2022-07-20 06:02:47,047 INFO L158 Benchmark]: Witness Printer took 71.13ms. Allocated memory is still 81.8MB. Free memory was 41.1MB in the beginning and 36.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:02:47,048 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.25ms. Allocated memory is still 52.4MB. Free memory was 33.7MB in the beginning and 33.7MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 610.45ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 27.8MB in the beginning and 32.7MB in the end (delta: -4.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.05ms. Allocated memory is still 67.1MB. Free memory was 32.7MB in the beginning and 47.8MB in the end (delta: -15.1MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.59ms. Allocated memory is still 67.1MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.80ms. Allocated memory is still 67.1MB. Free memory was 45.3MB in the beginning and 25.4MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 200170.17ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 25.1MB in the beginning and 41.1MB in the end (delta: -15.9MB). Peak memory consumption was 220.7kB. Max. memory is 16.1GB. * Witness Printer took 71.13ms. Allocated memory is still 81.8MB. Free memory was 41.1MB in the beginning and 36.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 90 locations, 25 error locations. Started 1 CEGAR loops. OverallTime: 200.1s, OverallIterations: 33, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 77.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2578 SdHoareTripleChecker+Valid, 13.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2555 mSDsluCounter, 15831 SdHoareTripleChecker+Invalid, 11.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1706 IncrementalHoareTripleChecker+Unchecked, 13372 mSDsCounter, 393 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8375 IncrementalHoareTripleChecker+Invalid, 10474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 393 mSolverCounterUnsat, 2459 mSDtfsCounter, 8375 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2427 GetRequests, 1752 SyntacticMatches, 48 SemanticMatches, 627 ConstructedPredicates, 14 IntricatePredicates, 4 DeprecatedPredicates, 6959 ImplicationChecksByTransitivity, 151.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=27, InterpolantAutomatonStates: 436, 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, 33 MinimizatonAttempts, 304 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 102.4s InterpolantComputationTime, 1724 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1889 ConstructedInterpolants, 220 QuantifiedInterpolants, 19148 SizeOfPredicates, 778 NumberOfNonLiveVariables, 11005 ConjunctsInSsa, 1408 ConjunctsInUnsatCore, 42 InterpolantComputations, 24 PerfectInterpolantSequences, 2959/3841 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-20 06:02:47,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE