./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 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_5.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 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:28:13,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:28:13,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:28:13,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:28:13,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:28:13,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:28:13,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:28:13,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:28:13,562 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:28:13,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:28:13,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:28:13,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:28:13,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:28:13,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:28:13,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:28:13,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:28:13,576 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:28:13,577 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:28:13,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:28:13,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:28:13,584 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:28:13,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:28:13,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:28:13,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:28:13,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:28:13,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:28:13,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:28:13,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:28:13,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:28:13,595 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:28:13,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:28:13,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:28:13,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:28:13,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:28:13,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:28:13,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:28:13,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:28:13,599 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:28:13,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:28:13,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:28:13,600 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:28:13,601 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:28:13,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:28:13,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:28:13,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:28:13,634 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:28:13,634 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:28:13,635 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:28:13,635 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:28:13,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:28:13,636 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:28:13,636 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:28:13,636 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:28:13,636 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:28:13,637 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:28:13,637 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:28:13,637 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:28:13,637 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:28:13,637 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:28:13,637 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:28:13,638 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:28:13,638 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:28:13,638 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:28:13,638 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:28:13,638 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:28:13,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:28:13,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:28:13,639 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:28:13,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:28:13,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:28:13,639 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:28:13,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:28:13,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:28:13,640 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 -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2022-07-21 17:28:13,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:28:13,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:28:13,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:28:13,934 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:28:13,936 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:28:13,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-07-21 17:28:13,986 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9c0df7b/43c894847ad244ba8313ae8627190797/FLAG4205f9e7e [2022-07-21 17:28:14,354 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:28:14,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-07-21 17:28:14,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9c0df7b/43c894847ad244ba8313ae8627190797/FLAG4205f9e7e [2022-07-21 17:28:14,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9c0df7b/43c894847ad244ba8313ae8627190797 [2022-07-21 17:28:14,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:28:14,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:28:14,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:14,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:28:14,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:28:14,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:14" (1/1) ... [2022-07-21 17:28:14,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b870f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:14, skipping insertion in model container [2022-07-21 17:28:14,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:14" (1/1) ... [2022-07-21 17:28:14,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:28:14,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:28:15,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:15,032 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-21 17:28:15,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@35d423f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:15, skipping insertion in model container [2022-07-21 17:28:15,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:15,036 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-21 17:28:15,038 INFO L158 Benchmark]: Toolchain (without parser) took 313.10ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 41.6MB in the end (delta: -1.5MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-07-21 17:28:15,038 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:28:15,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.45ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 41.6MB in the end (delta: -1.6MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-07-21 17:28:15,040 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.15ms. Allocated memory is still 60.8MB. Free memory was 42.8MB in the beginning and 42.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.45ms. Allocated memory is still 60.8MB. Free memory was 40.0MB in the beginning and 41.6MB in the end (delta: -1.6MB). Peak memory consumption was 12.2MB. 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_5.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 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:28:16,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:28:16,566 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:28:16,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:28:16,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:28:16,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:28:16,586 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:28:16,588 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:28:16,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:28:16,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:28:16,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:28:16,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:28:16,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:28:16,592 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:28:16,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:28:16,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:28:16,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:28:16,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:28:16,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:28:16,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:28:16,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:28:16,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:28:16,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:28:16,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:28:16,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:28:16,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:28:16,603 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:28:16,603 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:28:16,604 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:28:16,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:28:16,605 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:28:16,605 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:28:16,606 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:28:16,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:28:16,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:28:16,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:28:16,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:28:16,608 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:28:16,608 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:28:16,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:28:16,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:28:16,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:28:16,614 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:28:16,637 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:28:16,638 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:28:16,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:28:16,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:28:16,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:28:16,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:28:16,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:28:16,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:28:16,640 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:28:16,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:28:16,641 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:28:16,641 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:28:16,641 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:28:16,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:28:16,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:28:16,646 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:28:16,647 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:28:16,647 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:28:16,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:28:16,647 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:28:16,647 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:28:16,648 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:28:16,648 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:28:16,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:28:16,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:28:16,648 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:28:16,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:28:16,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:28:16,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:28:16,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:28:16,649 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:28:16,650 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:28:16,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:28:16,650 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 -> 43f8392da149a5e37da963296eece1aed541fa66405941aca1908b78e9471c4c [2022-07-21 17:28:16,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:28:16,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:28:16,920 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:28:16,921 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:28:16,922 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:28:16,923 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-07-21 17:28:16,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf768cb2/f477fea4c8544ce38f1ea1524357ff46/FLAGea334118c [2022-07-21 17:28:17,361 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:28:17,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2022-07-21 17:28:17,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf768cb2/f477fea4c8544ce38f1ea1524357ff46/FLAGea334118c [2022-07-21 17:28:17,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf768cb2/f477fea4c8544ce38f1ea1524357ff46 [2022-07-21 17:28:17,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:28:17,398 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:28:17,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:17,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:28:17,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:28:17,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:17,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f9cd583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17, skipping insertion in model container [2022-07-21 17:28:17,403 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:17,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:28:17,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:28:17,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:17,808 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-21 17:28:17,818 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:28:17,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:17,869 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:28:17,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:28:17,954 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:28:17,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17 WrapperNode [2022-07-21 17:28:17,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:28:17,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:28:17,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:28:17,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:28:17,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:17,997 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,015 INFO L137 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 24, calls inlined = 15, statements flattened = 102 [2022-07-21 17:28:18,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:28:18,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:28:18,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:28:18,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:28:18,024 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,037 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,053 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:28:18,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:28:18,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:28:18,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:28:18,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (1/1) ... [2022-07-21 17:28:18,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:28:18,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:28:18,094 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-21 17:28:18,103 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-21 17:28:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:28:18,121 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2022-07-21 17:28:18,121 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2022-07-21 17:28:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 17:28:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 17:28:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2022-07-21 17:28:18,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2022-07-21 17:28:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:28:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:28:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:28:18,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:28:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:28:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:28:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 17:28:18,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:28:18,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:28:18,227 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:28:18,237 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:28:18,544 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:28:18,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:28:18,548 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 17:28:18,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:28:18 BoogieIcfgContainer [2022-07-21 17:28:18,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:28:18,550 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:28:18,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:28:18,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:28:18,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:28:17" (1/3) ... [2022-07-21 17:28:18,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f33d842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:28:18, skipping insertion in model container [2022-07-21 17:28:18,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:28:17" (2/3) ... [2022-07-21 17:28:18,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f33d842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:28:18, skipping insertion in model container [2022-07-21 17:28:18,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:28:18" (3/3) ... [2022-07-21 17:28:18,554 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2022-07-21 17:28:18,568 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:28:18,568 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-21 17:28:18,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:28:18,614 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@502514d1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3cd2b9e1 [2022-07-21 17:28:18,614 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-21 17:28:18,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 71 states have internal predecessors, (78), 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-21 17:28:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:28:18,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:18,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:18,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -544283271, now seen corresponding path program 1 times [2022-07-21 17:28:18,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:18,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569294219] [2022-07-21 17:28:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:18,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:18,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:18,634 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-21 17:28:18,652 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-21 17:28:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:18,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:28:18,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:18,779 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-21 17:28:18,813 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-21 17:28:18,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:18,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:18,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569294219] [2022-07-21 17:28:18,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569294219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:18,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:18,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:18,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930155375] [2022-07-21 17:28:18,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:18,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:18,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:18,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:18,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:18,851 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.5918367346938775) internal successors, (78), 71 states have internal predecessors, (78), 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-21 17:28:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:19,099 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-07-21 17:28:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:19,101 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-21 17:28:19,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:19,107 INFO L225 Difference]: With dead ends: 102 [2022-07-21 17:28:19,107 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:28:19,108 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-21 17:28:19,110 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 52 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:19,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 288 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:28:19,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 81. [2022-07-21 17:28:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 73 states have internal predecessors, (81), 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-21 17:28:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-07-21 17:28:19,171 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 10 [2022-07-21 17:28:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:19,172 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-07-21 17:28:19,173 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-21 17:28:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-07-21 17:28:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 17:28:19,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:19,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:19,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 17:28:19,380 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-21 17:28:19,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:19,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash -515654120, now seen corresponding path program 1 times [2022-07-21 17:28:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808749487] [2022-07-21 17:28:19,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:19,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:19,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:19,383 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-21 17:28:19,388 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-21 17:28:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:19,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:28:19,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:19,509 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-21 17:28:19,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:19,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:19,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808749487] [2022-07-21 17:28:19,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808749487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:19,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:19,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475399756] [2022-07-21 17:28:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:19,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:28:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:19,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:28:19,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:19,513 INFO L87 Difference]: Start difference. First operand 81 states and 90 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-21 17:28:19,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:19,534 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2022-07-21 17:28:19,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:19,535 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-21 17:28:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:19,536 INFO L225 Difference]: With dead ends: 86 [2022-07-21 17:28:19,536 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 17:28:19,536 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-21 17:28:19,537 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 333 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-21 17:28:19,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 333 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 17:28:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-07-21 17:28:19,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 71 states have internal predecessors, (78), 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-21 17:28:19,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-21 17:28:19,542 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 10 [2022-07-21 17:28:19,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:19,543 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-21 17:28:19,543 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-21 17:28:19,543 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-21 17:28:19,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 17:28:19,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:19,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:19,566 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-21 17:28:19,750 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-21 17:28:19,750 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:19,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:19,751 INFO L85 PathProgramCache]: Analyzing trace with hash 307087832, now seen corresponding path program 1 times [2022-07-21 17:28:19,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931961252] [2022-07-21 17:28:19,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:19,753 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-21 17:28:19,754 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-21 17:28:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:19,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:28:19,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:19,809 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-21 17:28:19,870 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-21 17:28:19,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:19,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931961252] [2022-07-21 17:28:19,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931961252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:19,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:19,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056909506] [2022-07-21 17:28:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:19,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:19,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:19,873 INFO L87 Difference]: Start difference. First operand 79 states and 87 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-21 17:28:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:20,066 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2022-07-21 17:28:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:20,066 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-21 17:28:20,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:20,067 INFO L225 Difference]: With dead ends: 92 [2022-07-21 17:28:20,067 INFO L226 Difference]: Without dead ends: 92 [2022-07-21 17:28:20,067 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-21 17:28:20,068 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:20,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 359 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-21 17:28:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2022-07-21 17:28:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 70 states have internal predecessors, (77), 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-21 17:28:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2022-07-21 17:28:20,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 11 [2022-07-21 17:28:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:20,074 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2022-07-21 17:28:20,074 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-21 17:28:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2022-07-21 17:28:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:28:20,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:20,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:20,084 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-21 17:28:20,281 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-21 17:28:20,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash 149796357, now seen corresponding path program 1 times [2022-07-21 17:28:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:20,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203620055] [2022-07-21 17:28:20,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:20,284 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-21 17:28:20,285 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-21 17:28:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:20,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:28:20,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:20,379 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-21 17:28:20,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:20,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:20,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203620055] [2022-07-21 17:28:20,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203620055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:20,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:20,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:28:20,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649733365] [2022-07-21 17:28:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:20,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:28:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:20,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:28:20,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:28:20,381 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-21 17:28:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:20,402 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2022-07-21 17:28:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:28:20,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 14 [2022-07-21 17:28:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:20,404 INFO L225 Difference]: With dead ends: 85 [2022-07-21 17:28:20,404 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 17:28:20,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-21 17:28:20,410 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 20 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 318 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-21 17:28:20,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 318 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 17:28:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 78. [2022-07-21 17:28:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 70 states have internal predecessors, (76), 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-21 17:28:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-21 17:28:20,421 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 14 [2022-07-21 17:28:20,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:20,421 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-21 17:28:20,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-21 17:28:20,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-21 17:28:20,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-21 17:28:20,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:20,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:20,441 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-21 17:28:20,622 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-21 17:28:20,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:20,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:20,623 INFO L85 PathProgramCache]: Analyzing trace with hash -46717148, now seen corresponding path program 1 times [2022-07-21 17:28:20,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:20,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620120922] [2022-07-21 17:28:20,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:20,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:20,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:20,631 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-21 17:28:20,633 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-21 17:28:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:20,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:28:20,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:20,743 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-21 17:28:20,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:20,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:20,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620120922] [2022-07-21 17:28:20,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620120922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:20,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:20,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681966683] [2022-07-21 17:28:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:20,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:20,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:20,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:20,745 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 17:28:20,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:20,790 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-07-21 17:28:20,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:20,790 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 14 [2022-07-21 17:28:20,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:20,791 INFO L225 Difference]: With dead ends: 91 [2022-07-21 17:28:20,791 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 17:28:20,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 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-21 17:28:20,792 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 13 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:20,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 390 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 17:28:20,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2022-07-21 17:28:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 75 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:28:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-21 17:28:20,797 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 14 [2022-07-21 17:28:20,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:20,797 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-21 17:28:20,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-21 17:28:20,797 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-21 17:28:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 17:28:20,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:20,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:20,820 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-21 17:28:21,005 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-21 17:28:21,005 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:21,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:21,006 INFO L85 PathProgramCache]: Analyzing trace with hash -945781721, now seen corresponding path program 1 times [2022-07-21 17:28:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:21,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127153107] [2022-07-21 17:28:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:21,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:21,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:21,016 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-21 17:28:21,023 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-21 17:28:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:21,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:28:21,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:21,108 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-21 17:28:21,108 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:21,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:21,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127153107] [2022-07-21 17:28:21,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127153107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:21,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:21,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:28:21,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719443137] [2022-07-21 17:28:21,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:21,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:28:21,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:21,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:28:21,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:21,110 INFO L87 Difference]: Start difference. First operand 84 states and 91 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-21 17:28:21,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:21,129 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-21 17:28:21,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:28:21,130 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-21 17:28:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:21,131 INFO L225 Difference]: With dead ends: 90 [2022-07-21 17:28:21,131 INFO L226 Difference]: Without dead ends: 90 [2022-07-21 17:28:21,131 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-21 17:28:21,132 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 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-21 17:28:21,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-21 17:28:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-07-21 17:28:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 76 states have internal predecessors, (81), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:28:21,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2022-07-21 17:28:21,136 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2022-07-21 17:28:21,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:21,136 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2022-07-21 17:28:21,136 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-21 17:28:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2022-07-21 17:28:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 17:28:21,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:21,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:21,161 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-21 17:28:21,340 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-21 17:28:21,341 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:21,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:21,341 INFO L85 PathProgramCache]: Analyzing trace with hash 686278594, now seen corresponding path program 1 times [2022-07-21 17:28:21,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:21,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246173054] [2022-07-21 17:28:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:21,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:21,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:21,343 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-21 17:28:21,344 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-21 17:28:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:21,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:28:21,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:21,428 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-21 17:28:21,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:21,473 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-21 17:28:21,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:21,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246173054] [2022-07-21 17:28:21,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246173054] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:28:21,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:28:21,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 17:28:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107819948] [2022-07-21 17:28:21,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:28:21,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:28:21,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:28:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:21,474 INFO L87 Difference]: Start difference. First operand 85 states and 92 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-21 17:28:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:21,522 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-07-21 17:28:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:21,528 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-21 17:28:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:21,528 INFO L225 Difference]: With dead ends: 93 [2022-07-21 17:28:21,528 INFO L226 Difference]: Without dead ends: 93 [2022-07-21 17:28:21,528 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-21 17:28:21,529 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:21,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 387 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-21 17:28:21,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-07-21 17:28:21,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 59 states have (on average 1.423728813559322) internal successors, (84), 79 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:28:21,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-21 17:28:21,536 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 17 [2022-07-21 17:28:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:21,537 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-21 17:28:21,537 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-21 17:28:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-21 17:28:21,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:28:21,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:21,541 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:21,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-21 17:28:21,747 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-21 17:28:21,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:21,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1101750465, now seen corresponding path program 1 times [2022-07-21 17:28:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:21,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401161131] [2022-07-21 17:28:21,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:21,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:21,751 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-21 17:28:21,753 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-21 17:28:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:21,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:28:21,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:21,858 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:21,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:21,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401161131] [2022-07-21 17:28:21,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401161131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:21,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:21,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051880344] [2022-07-21 17:28:21,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:21,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:21,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:21,860 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:28:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:21,896 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-07-21 17:28:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:21,897 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-07-21 17:28:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:21,898 INFO L225 Difference]: With dead ends: 99 [2022-07-21 17:28:21,898 INFO L226 Difference]: Without dead ends: 99 [2022-07-21 17:28:21,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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-21 17:28:21,898 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 10 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:21,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 398 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:21,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-21 17:28:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-07-21 17:28:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 83 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:28:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2022-07-21 17:28:21,902 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 20 [2022-07-21 17:28:21,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:21,902 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2022-07-21 17:28:21,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:28:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-07-21 17:28:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:28:21,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:21,903 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:21,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:22,110 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-21 17:28:22,111 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:22,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473369, now seen corresponding path program 2 times [2022-07-21 17:28:22,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:22,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677647566] [2022-07-21 17:28:22,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:28:22,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:22,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:22,113 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-21 17:28:22,115 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-21 17:28:22,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:28:22,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:28:22,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:28:22,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:22,174 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-21 17:28:22,228 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-21 17:28:22,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:22,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:22,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677647566] [2022-07-21 17:28:22,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677647566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:22,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:22,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:28:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821145811] [2022-07-21 17:28:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:22,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:28:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:28:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:28:22,230 INFO L87 Difference]: Start difference. First operand 94 states and 101 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-21 17:28:22,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:22,430 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2022-07-21 17:28:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:28:22,432 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-21 17:28:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:22,433 INFO L225 Difference]: With dead ends: 100 [2022-07-21 17:28:22,433 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 17:28:22,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:28:22,433 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 35 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:22,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 377 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 17:28:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2022-07-21 17:28:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 63 states have (on average 1.380952380952381) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:28:22,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2022-07-21 17:28:22,437 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 20 [2022-07-21 17:28:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:22,437 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2022-07-21 17:28:22,437 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-21 17:28:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2022-07-21 17:28:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 17:28:22,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:22,438 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:22,446 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-21 17:28:22,644 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-21 17:28:22,645 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:22,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:22,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2128473368, now seen corresponding path program 1 times [2022-07-21 17:28:22,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:22,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166994159] [2022-07-21 17:28:22,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:22,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:22,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:22,646 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-21 17:28:22,666 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-21 17:28:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:22,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:28:22,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:22,769 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-21 17:28:22,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:22,901 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-21 17:28:22,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:22,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166994159] [2022-07-21 17:28:22,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166994159] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:28:22,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:28:22,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-21 17:28:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342260629] [2022-07-21 17:28:22,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:28:22,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:28:22,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:22,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:28:22,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:28:22,902 INFO L87 Difference]: Start difference. First operand 93 states and 100 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-21 17:28:23,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:23,092 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2022-07-21 17:28:23,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:23,093 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-21 17:28:23,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:23,094 INFO L225 Difference]: With dead ends: 102 [2022-07-21 17:28:23,094 INFO L226 Difference]: Without dead ends: 102 [2022-07-21 17:28:23,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:28:23,094 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:23,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 563 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:28:23,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-21 17:28:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-21 17:28:23,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 88 states have internal predecessors, (93), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-21 17:28:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2022-07-21 17:28:23,098 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 20 [2022-07-21 17:28:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:23,098 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2022-07-21 17:28:23,098 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-21 17:28:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2022-07-21 17:28:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-21 17:28:23,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:23,099 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] [2022-07-21 17:28:23,111 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-21 17:28:23,306 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-21 17:28:23,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:23,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -62141083, now seen corresponding path program 1 times [2022-07-21 17:28:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:23,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678486261] [2022-07-21 17:28:23,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:23,309 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-21 17:28:23,311 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-21 17:28:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:23,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:28:23,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:23,385 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-21 17:28:23,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:23,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:23,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678486261] [2022-07-21 17:28:23,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678486261] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:23,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:23,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:28:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168652202] [2022-07-21 17:28:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:23,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:28:23,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:28:23,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:28:23,388 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-21 17:28:23,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:23,464 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-21 17:28:23,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:28:23,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 23 [2022-07-21 17:28:23,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:23,465 INFO L225 Difference]: With dead ends: 105 [2022-07-21 17:28:23,465 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 17:28:23,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-21 17:28:23,466 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:23,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 151 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:28:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 17:28:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-07-21 17:28:23,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.396551724137931) internal successors, (81), 76 states have internal predecessors, (81), 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-21 17:28:23,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-21 17:28:23,468 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 23 [2022-07-21 17:28:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:23,468 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-21 17:28:23,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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-21 17:28:23,468 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-21 17:28:23,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 17:28:23,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:23,469 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:23,477 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-21 17:28:23,675 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-21 17:28:23,675 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2043849464, now seen corresponding path program 2 times [2022-07-21 17:28:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:23,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746112382] [2022-07-21 17:28:23,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:28:23,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:23,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:23,677 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-21 17:28:23,678 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-21 17:28:23,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:28:23,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:28:23,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:28:23,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:23,764 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-21 17:28:23,886 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-21 17:28:23,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:23,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746112382] [2022-07-21 17:28:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746112382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:23,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:28:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265157641] [2022-07-21 17:28:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:23,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:28:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:23,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:28:23,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:28:23,887 INFO L87 Difference]: Start difference. First operand 83 states and 89 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-21 17:28:24,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:24,153 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-07-21 17:28:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:28:24,153 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-21 17:28:24,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:24,154 INFO L225 Difference]: With dead ends: 99 [2022-07-21 17:28:24,154 INFO L226 Difference]: Without dead ends: 99 [2022-07-21 17:28:24,154 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-21 17:28:24,155 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 48 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:24,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 441 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-21 17:28:24,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2022-07-21 17:28:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 75 states have internal predecessors, (80), 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-21 17:28:24,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-21 17:28:24,157 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 26 [2022-07-21 17:28:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:24,157 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-21 17:28:24,157 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-21 17:28:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-21 17:28:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:28:24,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:24,158 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:28:24,177 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-21 17:28:24,364 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-21 17:28:24,365 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:24,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:24,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1441027708, now seen corresponding path program 1 times [2022-07-21 17:28:24,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:24,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292250643] [2022-07-21 17:28:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:24,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:24,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:24,373 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-21 17:28:24,374 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-21 17:28:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:24,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 17:28:24,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:24,635 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-21 17:28:24,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:24,984 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-21 17:28:24,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:24,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292250643] [2022-07-21 17:28:24,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292250643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:28:24,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:28:24,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-21 17:28:24,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635255760] [2022-07-21 17:28:24,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:28:24,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-21 17:28:24,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:24,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-21 17:28:24,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2022-07-21 17:28:24,986 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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-21 17:28:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:25,311 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2022-07-21 17:28:25,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:28:25,312 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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 30 [2022-07-21 17:28:25,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:25,312 INFO L225 Difference]: With dead ends: 88 [2022-07-21 17:28:25,312 INFO L226 Difference]: Without dead ends: 88 [2022-07-21 17:28:25,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2022-07-21 17:28:25,313 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 32 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:25,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 984 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-21 17:28:25,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-21 17:28:25,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 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-21 17:28:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-21 17:28:25,315 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 30 [2022-07-21 17:28:25,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:25,315 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-21 17:28:25,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 26 states have internal predecessors, (41), 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-21 17:28:25,315 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-21 17:28:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:28:25,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:25,316 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-21 17:28:25,324 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-21 17:28:25,524 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-21 17:28:25,524 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107868, now seen corresponding path program 2 times [2022-07-21 17:28:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:25,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332141798] [2022-07-21 17:28:25,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:28:25,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:25,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:25,526 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-21 17:28:25,527 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-21 17:28:25,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:28:25,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:28:25,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-21 17:28:25,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:25,613 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-21 17:28:25,767 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-21 17:28:25,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:25,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:25,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332141798] [2022-07-21 17:28:25,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332141798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:25,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:25,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:28:25,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843749434] [2022-07-21 17:28:25,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:25,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:28:25,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:25,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:28:25,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:28:25,769 INFO L87 Difference]: Start difference. First operand 88 states and 94 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-21 17:28:26,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:26,043 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-21 17:28:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:28:26,043 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-21 17:28:26,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:26,044 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:28:26,044 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:28:26,044 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-21 17:28:26,045 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 45 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:26,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 442 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:28:26,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 86. [2022-07-21 17:28:26,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 79 states have internal predecessors, (84), 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-21 17:28:26,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-21 17:28:26,047 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 36 [2022-07-21 17:28:26,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:26,047 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-21 17:28:26,047 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-21 17:28:26,048 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-21 17:28:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:28:26,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:26,048 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-21 17:28:26,058 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-21 17:28:26,248 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-21 17:28:26,249 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 18 more)] === [2022-07-21 17:28:26,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1541107867, now seen corresponding path program 1 times [2022-07-21 17:28:26,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:26,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065389894] [2022-07-21 17:28:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:26,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:26,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:26,251 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-21 17:28:26,252 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-21 17:28:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:26,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 17:28:26,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:26,380 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-21 17:28:26,448 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-21 17:28:26,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:26,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:26,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065389894] [2022-07-21 17:28:26,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065389894] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:26,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:26,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 17:28:26,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499694498] [2022-07-21 17:28:26,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:26,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:28:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:28:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:28:26,449 INFO L87 Difference]: Start difference. First operand 86 states and 92 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-21 17:28:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:26,630 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-07-21 17:28:26,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:28:26,630 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-21 17:28:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:26,631 INFO L225 Difference]: With dead ends: 87 [2022-07-21 17:28:26,631 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 17:28:26,631 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-21 17:28:26,631 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:26,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 349 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:28:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 17:28:26,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2022-07-21 17:28:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.28125) internal successors, (82), 77 states have internal predecessors, (82), 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-21 17:28:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-21 17:28:26,633 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 36 [2022-07-21 17:28:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:26,634 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-21 17:28:26,634 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-21 17:28:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-21 17:28:26,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-21 17:28:26,643 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:26,643 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-21 17:28:26,653 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-21 17:28:26,851 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-21 17:28:26,851 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:26,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:26,852 INFO L85 PathProgramCache]: Analyzing trace with hash 94582189, now seen corresponding path program 1 times [2022-07-21 17:28:26,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:26,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772153104] [2022-07-21 17:28:26,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:26,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:26,853 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-21 17:28:26,855 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-21 17:28:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:26,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:28:26,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:27,017 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-21 17:28:27,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:27,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:27,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772153104] [2022-07-21 17:28:27,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772153104] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:27,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:27,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:28:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848128749] [2022-07-21 17:28:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:27,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:28:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:28:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:28:27,019 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-21 17:28:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:27,042 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-07-21 17:28:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:28:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-21 17:28:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:27,043 INFO L225 Difference]: With dead ends: 84 [2022-07-21 17:28:27,044 INFO L226 Difference]: Without dead ends: 84 [2022-07-21 17:28:27,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-21 17:28:27,044 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 23 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 306 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-21 17:28:27,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 306 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-21 17:28:27,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-21 17:28:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.265625) internal successors, (81), 77 states have internal predecessors, (81), 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-21 17:28:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-21 17:28:27,047 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 36 [2022-07-21 17:28:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:27,047 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-21 17:28:27,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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-21 17:28:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-21 17:28:27,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:28:27,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:27,048 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] [2022-07-21 17:28:27,058 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-21 17:28:27,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:28:27,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2072333273, now seen corresponding path program 1 times [2022-07-21 17:28:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669640312] [2022-07-21 17:28:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:27,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:27,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:27,257 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:28:27,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:28:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:27,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:28:27,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:27,434 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-21 17:28:27,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:27,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:27,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669640312] [2022-07-21 17:28:27,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669640312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:27,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:27,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 17:28:27,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629282535] [2022-07-21 17:28:27,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:27,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:28:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:27,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:28:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:28:27,436 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-21 17:28:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:27,474 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-07-21 17:28:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:28:27,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 38 [2022-07-21 17:28:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:27,475 INFO L225 Difference]: With dead ends: 84 [2022-07-21 17:28:27,475 INFO L226 Difference]: Without dead ends: 84 [2022-07-21 17:28:27,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 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-21 17:28:27,476 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 351 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-21 17:28:27,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 351 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-21 17:28:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-21 17:28:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 64 states have (on average 1.25) internal successors, (80), 76 states have internal predecessors, (80), 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-21 17:28:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-07-21 17:28:27,478 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 38 [2022-07-21 17:28:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:27,478 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-07-21 17:28:27,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-21 17:28:27,478 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-07-21 17:28:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:28:27,479 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:27,479 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] [2022-07-21 17:28:27,501 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-21 17:28:27,679 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-21 17:28:27,680 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:27,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:27,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293974, now seen corresponding path program 1 times [2022-07-21 17:28:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:27,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277704630] [2022-07-21 17:28:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:27,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:27,689 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-21 17:28:27,690 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-21 17:28:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:27,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:28:27,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:27,876 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-21 17:28:27,999 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-21 17:28:27,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:27,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:27,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277704630] [2022-07-21 17:28:27,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277704630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:27,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:27,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:28:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702963966] [2022-07-21 17:28:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:28,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:28:28,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:28,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:28:28,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:28:28,000 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-21 17:28:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:28,244 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-07-21 17:28:28,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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 46 [2022-07-21 17:28:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:28,246 INFO L225 Difference]: With dead ends: 115 [2022-07-21 17:28:28,246 INFO L226 Difference]: Without dead ends: 115 [2022-07-21 17:28:28,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 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-21 17:28:28,246 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 103 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:28,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 358 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2022-07-21 17:28:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-21 17:28:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2022-07-21 17:28:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 90 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-21 17:28:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-07-21 17:28:28,249 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 46 [2022-07-21 17:28:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:28,249 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-07-21 17:28:28,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 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-21 17:28:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-07-21 17:28:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:28:28,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:28,250 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] [2022-07-21 17:28:28,258 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-21 17:28:28,457 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-21 17:28:28,457 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:28,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:28,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1357293975, now seen corresponding path program 1 times [2022-07-21 17:28:28,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:28,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516081468] [2022-07-21 17:28:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:28,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:28,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:28,460 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-21 17:28:28,474 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-21 17:28:28,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:28,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-21 17:28:28,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:28,710 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-21 17:28:28,926 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-21 17:28:28,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:28,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516081468] [2022-07-21 17:28:28,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516081468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:28,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:28,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:28:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139613144] [2022-07-21 17:28:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:28,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:28:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:28:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:28:28,927 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-21 17:28:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:29,206 INFO L93 Difference]: Finished difference Result 125 states and 131 transitions. [2022-07-21 17:28:29,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:28:29,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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 46 [2022-07-21 17:28:29,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:29,207 INFO L225 Difference]: With dead ends: 125 [2022-07-21 17:28:29,207 INFO L226 Difference]: Without dead ends: 125 [2022-07-21 17:28:29,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 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-21 17:28:29,208 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:29,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 401 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 194 Invalid, 0 Unknown, 15 Unchecked, 0.2s Time] [2022-07-21 17:28:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-21 17:28:29,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-21 17:28:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 98 states have internal predecessors, (113), 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-21 17:28:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2022-07-21 17:28:29,210 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 46 [2022-07-21 17:28:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:29,210 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2022-07-21 17:28:29,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 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-21 17:28:29,210 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2022-07-21 17:28:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:28:29,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:29,211 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] [2022-07-21 17:28:29,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-21 17:28:29,412 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-21 17:28:29,412 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:29,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:29,412 INFO L85 PathProgramCache]: Analyzing trace with hash -882834383, now seen corresponding path program 1 times [2022-07-21 17:28:29,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:29,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491695837] [2022-07-21 17:28:29,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:29,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:29,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:29,428 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-21 17:28:29,431 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-21 17:28:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:29,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:28:29,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:29,699 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-21 17:28:29,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:29,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491695837] [2022-07-21 17:28:29,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1491695837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:29,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:29,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:28:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729776338] [2022-07-21 17:28:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:28:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:28:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:28:29,701 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-21 17:28:29,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:29,773 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-07-21 17:28:29,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:28:29,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 52 [2022-07-21 17:28:29,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:29,775 INFO L225 Difference]: With dead ends: 111 [2022-07-21 17:28:29,776 INFO L226 Difference]: Without dead ends: 109 [2022-07-21 17:28:29,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 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-21 17:28:29,778 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:29,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 425 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:28:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-21 17:28:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-07-21 17:28:29,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 98 states have internal predecessors, (112), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:28:29,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2022-07-21 17:28:29,786 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 52 [2022-07-21 17:28:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:29,786 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2022-07-21 17:28:29,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-21 17:28:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2022-07-21 17:28:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:28:29,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:29,788 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] [2022-07-21 17:28:29,798 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-21 17:28:29,996 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-21 17:28:29,997 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:29,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:29,997 INFO L85 PathProgramCache]: Analyzing trace with hash -644390150, now seen corresponding path program 1 times [2022-07-21 17:28:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:29,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552289766] [2022-07-21 17:28:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:29,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:29,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:29,999 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-21 17:28:30,000 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-21 17:28:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:30,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 17:28:30,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:30,215 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-21 17:28:30,334 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-21 17:28:30,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:30,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:30,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552289766] [2022-07-21 17:28:30,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552289766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:30,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:30,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:28:30,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407032676] [2022-07-21 17:28:30,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:30,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:28:30,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:30,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:28:30,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:28:30,335 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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-21 17:28:30,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:30,595 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2022-07-21 17:28:30,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:30,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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 52 [2022-07-21 17:28:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:30,596 INFO L225 Difference]: With dead ends: 113 [2022-07-21 17:28:30,596 INFO L226 Difference]: Without dead ends: 113 [2022-07-21 17:28:30,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 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-21 17:28:30,597 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 76 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:30,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 387 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-07-21 17:28:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-21 17:28:30,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-07-21 17:28:30,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 97 states have internal predecessors, (109), 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-21 17:28:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-07-21 17:28:30,599 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 52 [2022-07-21 17:28:30,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:30,599 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-07-21 17:28:30,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 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-21 17:28:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-07-21 17:28:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-21 17:28:30,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:30,600 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] [2022-07-21 17:28:30,616 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-21 17:28:30,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-21 17:28:30,801 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash -644390149, now seen corresponding path program 1 times [2022-07-21 17:28:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:30,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89598504] [2022-07-21 17:28:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:30,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:30,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:30,803 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-21 17:28:30,804 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-21 17:28:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:31,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-21 17:28:31,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:31,076 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-21 17:28:31,329 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-21 17:28:31,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:31,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:31,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89598504] [2022-07-21 17:28:31,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89598504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:31,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:31,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 17:28:31,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333043960] [2022-07-21 17:28:31,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:31,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:28:31,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:28:31,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:28:31,331 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-21 17:28:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:31,687 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2022-07-21 17:28:31,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:31,688 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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 52 [2022-07-21 17:28:31,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:31,689 INFO L225 Difference]: With dead ends: 114 [2022-07-21 17:28:31,689 INFO L226 Difference]: Without dead ends: 114 [2022-07-21 17:28:31,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 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-21 17:28:31,690 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 126 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:31,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 15 Unchecked, 0.3s Time] [2022-07-21 17:28:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-21 17:28:31,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-07-21 17:28:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 97 states have internal predecessors, (107), 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-21 17:28:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2022-07-21 17:28:31,694 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 52 [2022-07-21 17:28:31,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:31,694 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2022-07-21 17:28:31,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 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-21 17:28:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2022-07-21 17:28:31,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:28:31,695 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:31,695 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-21 17:28:31,706 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-21 17:28:31,903 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-21 17:28:31,904 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:31,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:31,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1476913121, now seen corresponding path program 1 times [2022-07-21 17:28:31,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:31,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685686927] [2022-07-21 17:28:31,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:31,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:31,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:31,906 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-21 17:28:31,908 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-21 17:28:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:32,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-21 17:28:32,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:32,511 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-21 17:28:32,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:32,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:32,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685686927] [2022-07-21 17:28:32,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685686927] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:32,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:32,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:28:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402404827] [2022-07-21 17:28:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:32,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:28:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:32,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:28:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:28:32,513 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 13 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-21 17:28:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:32,819 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2022-07-21 17:28:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:32,819 INFO L78 Accepts]: Start accepts. Automaton has has 13 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-21 17:28:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:32,820 INFO L225 Difference]: With dead ends: 113 [2022-07-21 17:28:32,820 INFO L226 Difference]: Without dead ends: 113 [2022-07-21 17:28:32,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:28:32,821 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 170 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:32,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 502 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 211 Invalid, 0 Unknown, 12 Unchecked, 0.2s Time] [2022-07-21 17:28:32,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-21 17:28:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106. [2022-07-21 17:28:32,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 97 states have internal predecessors, (106), 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-21 17:28:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-07-21 17:28:32,823 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 55 [2022-07-21 17:28:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:32,823 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-07-21 17:28:32,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 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-21 17:28:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-07-21 17:28:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-21 17:28:32,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:32,823 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] [2022-07-21 17:28:32,839 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-21 17:28:33,024 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-21 17:28:33,024 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:33,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1073931710, now seen corresponding path program 1 times [2022-07-21 17:28:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:33,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154240396] [2022-07-21 17:28:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:33,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:33,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:33,026 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-21 17:28:33,028 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-21 17:28:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:33,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-21 17:28:33,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:33,476 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-21 17:28:33,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,525 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-21 17:28:33,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,578 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-21 17:28:33,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,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 21 treesize of output 20 [2022-07-21 17:28:33,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,636 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-21 17:28:33,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,675 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-21 17:28:33,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,712 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-21 17:28:33,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,765 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-21 17:28:33,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,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-21 17:28:33,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,842 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-21 17:28:33,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,889 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-21 17:28:33,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,932 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-21 17:28:33,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:33,980 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-21 17:28:34,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,030 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-21 17:28:34,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,075 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-21 17:28:34,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,114 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-21 17:28:34,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:34,294 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-21 17:28:39,537 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1615 (_ 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_1613) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1615)))) is different from true [2022-07-21 17:28:39,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,559 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-21 17:28:39,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:39,773 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-21 17:28:39,854 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-21 17:28:39,914 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:39,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:40,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:40,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154240396] [2022-07-21 17:28:40,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154240396] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:28:40,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118188326] [2022-07-21 17:28:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:28:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:28:40,654 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:28:40,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-21 17:28:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:41,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-21 17:28:41,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:41,279 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-21 17:28:41,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,294 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-21 17:28:41,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,318 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-21 17:28:41,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,343 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-21 17:28:41,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,362 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-21 17:28:41,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,388 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-21 17:28:41,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,416 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-21 17:28:41,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,431 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-21 17:28:41,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,461 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-21 17:28:41,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,498 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-21 17:28:41,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,514 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-21 17:28:41,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,562 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-21 17:28:41,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,577 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-21 17:28:41,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,629 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-21 17:28:41,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,664 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-21 17:28:41,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,701 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-21 17:28:41,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:41,755 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-21 17:28:44,839 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1810 (_ 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_1613) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1810)))) is different from true [2022-07-21 17:28:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:44,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:44,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:44,851 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-21 17:28:44,942 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-21 17:28:45,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:28:45,032 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-21 17:28:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:28:45,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:46,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2118188326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:28:46,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:28:46,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 39] total 44 [2022-07-21 17:28:46,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090940418] [2022-07-21 17:28:46,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:28:46,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-21 17:28:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-21 17:28:46,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3198, Unknown=3, NotChecked=230, Total=3660 [2022-07-21 17:28:46,603 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:50,928 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1615 (_ 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_1613) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1615)))) (exists ((v_ArrVal_1613 (_ BitVec 32)) (v_ArrVal_1810 (_ 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_1613) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_1810))))) is different from true [2022-07-21 17:28:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:51,768 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-07-21 17:28:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 17:28:51,769 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-21 17:28:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:51,770 INFO L225 Difference]: With dead ends: 121 [2022-07-21 17:28:51,770 INFO L226 Difference]: Without dead ends: 121 [2022-07-21 17:28:51,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 86 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1864 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=560, Invalid=7458, Unknown=4, NotChecked=534, Total=8556 [2022-07-21 17:28:51,772 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 204 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:51,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 825 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1260 Invalid, 0 Unknown, 310 Unchecked, 1.7s Time] [2022-07-21 17:28:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-21 17:28:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2022-07-21 17:28:51,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.206896551724138) internal successors, (105), 97 states have internal predecessors, (105), 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-21 17:28:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-21 17:28:51,774 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 58 [2022-07-21 17:28:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:51,774 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-21 17:28:51,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 42 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:28:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-21 17:28:51,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 17:28:51,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:51,775 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] [2022-07-21 17:28:51,815 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-21 17:28:51,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:52,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 17:28:52,187 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:52,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896519, now seen corresponding path program 1 times [2022-07-21 17:28:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:52,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084384423] [2022-07-21 17:28:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:52,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:52,196 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-21 17:28:52,197 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-21 17:28:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:52,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:28:52,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:52,488 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-21 17:28:52,638 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-21 17:28:52,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:28:52,740 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-21 17:28:52,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:52,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084384423] [2022-07-21 17:28:52,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084384423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:28:52,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:28:52,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2022-07-21 17:28:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052985322] [2022-07-21 17:28:52,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:28:52,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:28:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:28:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:28:52,743 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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-21 17:28:53,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:53,044 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-07-21 17:28:53,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:28:53,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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 60 [2022-07-21 17:28:53,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:53,045 INFO L225 Difference]: With dead ends: 146 [2022-07-21 17:28:53,045 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 17:28:53,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2022-07-21 17:28:53,046 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 114 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:53,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 447 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 303 Invalid, 0 Unknown, 46 Unchecked, 0.2s Time] [2022-07-21 17:28:53,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 17:28:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2022-07-21 17:28:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2095238095238094) internal successors, (127), 117 states have internal predecessors, (127), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:28:53,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-21 17:28:53,055 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 60 [2022-07-21 17:28:53,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:53,055 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-21 17:28:53,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.416666666666667) internal successors, (53), 11 states have internal predecessors, (53), 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-21 17:28:53,055 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-21 17:28:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-21 17:28:53,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:53,059 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] [2022-07-21 17:28:53,073 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-21 17:28:53,270 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-21 17:28:53,271 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1122896518, now seen corresponding path program 1 times [2022-07-21 17:28:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:53,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678979430] [2022-07-21 17:28:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:53,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:53,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:53,273 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-21 17:28:53,274 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-21 17:28:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:53,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:28:53,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:53,520 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-21 17:28:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:28:53,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:28:53,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:28:53,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678979430] [2022-07-21 17:28:53,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678979430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:28:53,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:28:53,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:28:53,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069909657] [2022-07-21 17:28:53,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:28:53,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:28:53,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:28:53,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:28:53,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:28:53,771 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:28:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:28:53,970 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-07-21 17:28:53,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 17:28:53,971 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2022-07-21 17:28:53,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:28:53,972 INFO L225 Difference]: With dead ends: 135 [2022-07-21 17:28:53,972 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 17:28:53,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:28:53,972 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 31 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:28:53,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 412 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-21 17:28:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 17:28:53,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-07-21 17:28:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 105 states have (on average 1.2) internal successors, (126), 117 states have internal predecessors, (126), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:28:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-07-21 17:28:53,975 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 60 [2022-07-21 17:28:53,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:28:53,975 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-07-21 17:28:53,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:28:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-07-21 17:28:53,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 17:28:53,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:28:53,975 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] [2022-07-21 17:28:53,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-21 17:28:54,183 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-21 17:28:54,183 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:28:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:28:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1067855226, now seen corresponding path program 1 times [2022-07-21 17:28:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:28:54,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089018081] [2022-07-21 17:28:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:28:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:28:54,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:28:54,185 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-21 17:28:54,187 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-21 17:28:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:28:54,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-21 17:28:54,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:28:54,626 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-21 17:28:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,648 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-21 17:28:54,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,682 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-21 17:28:54,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:28:54,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,748 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-21 17:28:54,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-07-21 17:28:54,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:28:54,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,858 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-21 17:28:54,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,897 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-21 17:28:54,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,937 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-21 17:28:54,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:54,975 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-21 17:28:55,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,018 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-21 17:28:55,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,060 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-21 17:28:55,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,107 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-21 17:28:55,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,151 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-21 17:28:55,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:28:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:28:55,345 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-21 17:29:00,629 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ 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_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2288)) |c_#memory_$Pointer$.base|)) is different from true [2022-07-21 17:29:00,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,640 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-21 17:29:00,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:00,846 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-21 17:29:00,924 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-21 17:29:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:01,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:01,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:01,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089018081] [2022-07-21 17:29:01,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089018081] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:29:01,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [257174796] [2022-07-21 17:29:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:01,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:29:01,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:29:01,766 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:29:01,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-21 17:29:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:02,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 122 conjunts are in the unsatisfiable core [2022-07-21 17:29:02,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:02,347 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-21 17:29:02,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,362 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-21 17:29:02,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,371 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-21 17:29:02,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,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, 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-21 17:29:02,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,434 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-21 17:29:02,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,457 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-21 17:29:02,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,469 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-21 17:29:02,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,487 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-21 17:29:02,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,505 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-21 17:29:02,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 17:29:02,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,576 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-21 17:29:02,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,624 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-21 17:29:02,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,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, 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-21 17:29:02,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,661 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-21 17:29:02,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,673 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-21 17:29:02,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,684 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-21 17:29:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:02,740 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-21 17:29:05,722 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2483 (_ BitVec 32)) (v_ArrVal_2286 (_ 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_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2483)))) is different from true [2022-07-21 17:29:05,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:05,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:05,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:29:05,733 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-21 17:29:05,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 28 treesize of output 39 [2022-07-21 17:29:05,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:29:05,918 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-21 17:29:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:29:06,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:07,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [257174796] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:29:07,470 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:29:07,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 41] total 46 [2022-07-21 17:29:07,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408035961] [2022-07-21 17:29:07,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:29:07,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 17:29:07,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 17:29:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3299, Unknown=3, NotChecked=234, Total=3782 [2022-07-21 17:29:07,473 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:29:11,161 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2483 (_ BitVec 32)) (v_ArrVal_2286 (_ 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_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2483)))) (exists ((v_ArrVal_2286 (_ BitVec 32)) (v_ArrVal_2288 (_ 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_2286) (bvadd (_ bv4 32) |c_LDV_INIT_LIST_HEAD_#in~list.offset|) v_ArrVal_2288)) |c_#memory_$Pointer$.base|))) is different from true [2022-07-21 17:29:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:12,116 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-07-21 17:29:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-21 17:29:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2022-07-21 17:29:12,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:12,117 INFO L225 Difference]: With dead ends: 140 [2022-07-21 17:29:12,117 INFO L226 Difference]: Without dead ends: 139 [2022-07-21 17:29:12,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 92 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1590 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=481, Invalid=5379, Unknown=4, NotChecked=456, Total=6320 [2022-07-21 17:29:12,119 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 174 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 251 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:12,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 911 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1327 Invalid, 0 Unknown, 251 Unchecked, 1.9s Time] [2022-07-21 17:29:12,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-21 17:29:12,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2022-07-21 17:29:12,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1764705882352942) internal successors, (120), 114 states have internal predecessors, (120), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:12,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2022-07-21 17:29:12,122 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 59 [2022-07-21 17:29:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:12,122 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2022-07-21 17:29:12,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 43 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:29:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2022-07-21 17:29:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 17:29:12,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:12,123 INFO L195 NwaCegarLoop]: trace histogram [16, 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] [2022-07-21 17:29:12,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:12,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:12,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:12,523 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1066761989, now seen corresponding path program 1 times [2022-07-21 17:29:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:12,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398520966] [2022-07-21 17:29:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:12,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:12,525 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-21 17:29:12,526 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-21 17:29:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:12,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-21 17:29:12,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:12,844 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-21 17:29:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:29:13,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:13,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:13,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398520966] [2022-07-21 17:29:13,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398520966] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:13,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:13,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:29:13,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969608860] [2022-07-21 17:29:13,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:13,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 17:29:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 17:29:13,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:29:13,107 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:13,303 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-07-21 17:29:13,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:29:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-07-21 17:29:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:13,304 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:29:13,304 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:29:13,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-21 17:29:13,305 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 29 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:13,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 334 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-21 17:29:13,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:29:13,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-07-21 17:29:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1666666666666667) internal successors, (119), 114 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2022-07-21 17:29:13,307 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 62 [2022-07-21 17:29:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:13,307 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2022-07-21 17:29:13,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2022-07-21 17:29:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 17:29:13,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:13,308 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] [2022-07-21 17:29:13,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:13,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:13,522 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:13,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:13,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1335956715, now seen corresponding path program 1 times [2022-07-21 17:29:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080562360] [2022-07-21 17:29:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:13,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:13,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:13,524 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:13,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-21 17:29:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:13,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 17:29:13,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-21 17:29:13,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:13,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:13,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080562360] [2022-07-21 17:29:13,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080562360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:13,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:13,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:29:13,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798503448] [2022-07-21 17:29:13,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:13,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:29:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:13,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:29:13,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:29:13,878 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:29:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:13,944 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-21 17:29:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:29:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2022-07-21 17:29:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:13,945 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:29:13,945 INFO L226 Difference]: Without dead ends: 125 [2022-07-21 17:29:13,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:29:13,946 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 46 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:13,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 423 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:29:13,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-21 17:29:13,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-21 17:29:13,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 102 states have (on average 1.1470588235294117) internal successors, (117), 114 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:13,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-21 17:29:13,949 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 63 [2022-07-21 17:29:13,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:13,949 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-21 17:29:13,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:29:13,949 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-21 17:29:13,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 17:29:13,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:13,950 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] [2022-07-21 17:29:13,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:14,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:14,162 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:14,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836323, now seen corresponding path program 1 times [2022-07-21 17:29:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:14,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456294694] [2022-07-21 17:29:14,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:14,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:14,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:14,165 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-21 17:29:14,166 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-21 17:29:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:14,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-21 17:29:14,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:14,504 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-21 17:29:14,629 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-21 17:29:14,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:29:14,780 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-21 17:29:14,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:14,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456294694] [2022-07-21 17:29:14,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456294694] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:29:14,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:29:14,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2022-07-21 17:29:14,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623792228] [2022-07-21 17:29:14,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:29:14,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 17:29:14,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:14,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 17:29:14,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:29:14,782 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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-21 17:29:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:15,110 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-21 17:29:15,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:29:15,110 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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 66 [2022-07-21 17:29:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:15,111 INFO L225 Difference]: With dead ends: 127 [2022-07-21 17:29:15,111 INFO L226 Difference]: Without dead ends: 127 [2022-07-21 17:29:15,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 116 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-21 17:29:15,111 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:15,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 258 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-07-21 17:29:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-21 17:29:15,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2022-07-21 17:29:15,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.1553398058252426) internal successors, (119), 115 states have internal predecessors, (119), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:15,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2022-07-21 17:29:15,114 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 66 [2022-07-21 17:29:15,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:15,114 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2022-07-21 17:29:15,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.538461538461538) internal successors, (59), 12 states have internal predecessors, (59), 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-21 17:29:15,114 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2022-07-21 17:29:15,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 17:29:15,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:15,114 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] [2022-07-21 17:29:15,126 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-21 17:29:15,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:15,318 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:15,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1794836322, now seen corresponding path program 1 times [2022-07-21 17:29:15,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:15,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177477215] [2022-07-21 17:29:15,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:15,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:15,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:15,320 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:15,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-21 17:29:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:15,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:29:15,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:15,700 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-21 17:29:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:29:15,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:15,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:15,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177477215] [2022-07-21 17:29:15,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177477215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:15,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:15,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 17:29:15,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323232832] [2022-07-21 17:29:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:15,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:29:15,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:15,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:29:15,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:29:15,976 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:16,217 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-07-21 17:29:16,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 17:29:16,218 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 66 [2022-07-21 17:29:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:16,218 INFO L225 Difference]: With dead ends: 129 [2022-07-21 17:29:16,218 INFO L226 Difference]: Without dead ends: 129 [2022-07-21 17:29:16,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-07-21 17:29:16,219 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 30 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:16,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 439 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-07-21 17:29:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-21 17:29:16,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2022-07-21 17:29:16,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.145631067961165) internal successors, (118), 115 states have internal predecessors, (118), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-21 17:29:16,221 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 66 [2022-07-21 17:29:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:16,221 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-21 17:29:16,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-21 17:29:16,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 17:29:16,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:16,222 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] [2022-07-21 17:29:16,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:16,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:16,432 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:16,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1739148477, now seen corresponding path program 1 times [2022-07-21 17:29:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:16,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955910264] [2022-07-21 17:29:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:16,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:16,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:16,435 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-21 17:29:16,436 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-21 17:29:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:16,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:29:16,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:29:16,947 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:16,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:16,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955910264] [2022-07-21 17:29:16,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955910264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:16,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:16,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:29:16,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024309582] [2022-07-21 17:29:16,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:16,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:29:16,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:29:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:29:16,950 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:17,060 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-07-21 17:29:17,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 17:29:17,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-07-21 17:29:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:17,061 INFO L225 Difference]: With dead ends: 125 [2022-07-21 17:29:17,061 INFO L226 Difference]: Without dead ends: 125 [2022-07-21 17:29:17,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:29:17,063 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:17,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 668 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:29:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-21 17:29:17,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-21 17:29:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 114 states have internal predecessors, (117), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-07-21 17:29:17,067 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 68 [2022-07-21 17:29:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:17,068 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-07-21 17:29:17,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-07-21 17:29:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 17:29:17,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:17,069 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] [2022-07-21 17:29:17,081 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-21 17:29:17,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:17,282 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:17,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:17,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1920971938, now seen corresponding path program 1 times [2022-07-21 17:29:17,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:17,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294275703] [2022-07-21 17:29:17,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:17,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:17,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:17,284 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:29:17,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-21 17:29:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:29:17,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-21 17:29:17,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:29:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-21 17:29:18,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:29:18,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:29:18,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294275703] [2022-07-21 17:29:18,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294275703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:29:18,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:29:18,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 17:29:18,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078801577] [2022-07-21 17:29:18,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:29:18,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 17:29:18,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:29:18,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 17:29:18,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:29:18,137 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:18,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:29:18,339 INFO L93 Difference]: Finished difference Result 138 states and 143 transitions. [2022-07-21 17:29:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 17:29:18,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2022-07-21 17:29:18,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:29:18,340 INFO L225 Difference]: With dead ends: 138 [2022-07-21 17:29:18,340 INFO L226 Difference]: Without dead ends: 138 [2022-07-21 17:29:18,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-21 17:29:18,341 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 91 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:29:18,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 455 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-07-21 17:29:18,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-21 17:29:18,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2022-07-21 17:29:18,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.1320754716981132) internal successors, (120), 117 states have internal predecessors, (120), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-21 17:29:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-21 17:29:18,349 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 69 [2022-07-21 17:29:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:29:18,350 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-21 17:29:18,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:29:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-21 17:29:18,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 17:29:18,351 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:29:18,351 INFO L195 NwaCegarLoop]: trace histogram [16, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:18,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:18,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:18,560 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-21 17:29:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:29:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295794, now seen corresponding path program 1 times [2022-07-21 17:29:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:29:18,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108506197] [2022-07-21 17:29:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:29:18,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:29:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:29:18,562 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-21 17:29:18,564 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-21 17:29:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:29:18,984 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 17:29:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 17:29:19,289 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-21 17:29:19,289 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 17:29:19,290 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_kobject_putErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-07-21 17:29:19,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-07-21 17:29:19,306 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (15 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr6ASSERT_VIOLATIONMEMORY_FREE (5 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr7ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr8ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr9ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr10ASSERT_VIOLATIONMEMORY_FREE (1 of 21 remaining) [2022-07-21 17:29:19,307 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_kobject_putErr11ASSERT_VIOLATIONMEMORY_FREE (0 of 21 remaining) [2022-07-21 17:29:19,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-21 17:29:19,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:29:19,510 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:29:19,513 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 17:29:19,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,519 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,520 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,523 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,524 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,525 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,537 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,538 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,540 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,541 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,542 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,544 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,544 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,545 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,546 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,547 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,550 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,550 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 05:29:19 BoogieIcfgContainer [2022-07-21 17:29:19,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 17:29:19,587 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 17:29:19,587 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 17:29:19,587 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 17:29:19,587 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:28:18" (3/4) ... [2022-07-21 17:29:19,589 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,592 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,593 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,593 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,593 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,593 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,594 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,594 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,595 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,596 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,597 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,598 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,598 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,599 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,600 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,601 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,602 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,602 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,602 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,602 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,602 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,602 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,603 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-21 17:29:19,604 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-21 17:29:19,649 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-21 17:29:19,649 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 17:29:19,650 INFO L158 Benchmark]: Toolchain (without parser) took 62251.61ms. Allocated memory was 52.4MB in the beginning and 92.3MB in the end (delta: 39.8MB). Free memory was 27.8MB in the beginning and 38.3MB in the end (delta: -10.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,650 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:29:19,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.18ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 27.6MB in the beginning and 38.6MB in the end (delta: -11.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.76ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,650 INFO L158 Benchmark]: Boogie Preprocessor took 35.55ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 33.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,651 INFO L158 Benchmark]: RCFGBuilder took 495.64ms. Allocated memory is still 62.9MB. Free memory was 33.7MB in the beginning and 28.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,651 INFO L158 Benchmark]: TraceAbstraction took 61036.02ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 27.7MB in the beginning and 48.2MB in the end (delta: -20.5MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,651 INFO L158 Benchmark]: Witness Printer took 62.60ms. Allocated memory is still 92.3MB. Free memory was 48.2MB in the beginning and 38.3MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:29:19,652 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.19ms. Allocated memory is still 52.4MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.18ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 27.6MB in the beginning and 38.6MB in the end (delta: -11.0MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.76ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.55ms. Allocated memory is still 62.9MB. Free memory was 36.0MB in the beginning and 33.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 495.64ms. Allocated memory is still 62.9MB. Free memory was 33.7MB in the beginning and 28.2MB in the end (delta: 5.5MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * TraceAbstraction took 61036.02ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 27.7MB in the beginning and 48.2MB in the end (delta: -20.5MB). Peak memory consumption was 37.6MB. Max. memory is 16.1GB. * Witness Printer took 62.60ms. Allocated memory is still 92.3MB. Free memory was 48.2MB in the beginning and 38.3MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * 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 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [ldv_global_msg_list={1:0}] [L770] CALL entry_point() [L764] struct ldv_kobject *kobj; [L765] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}, ldv_malloc(sizeof(*kobj))={2:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [ldv_global_msg_list={1:0}, list={2:4}] [L540] list->next = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L541] list->prev = list VAL [ldv_global_msg_list={1:0}, list={2:4}, list={2:4}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L765] RET, EXPR ldv_kobject_create() [L765] kobj = ldv_kobject_create() [L766] CALL f_22_put(kobj) [L761] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL, EXPR ldv_kref_sub(kref, 1, release) [L674] CALL, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] EXPR v->counter VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}, v->counter=1] [L666] temp = v->counter [L667] temp -= i VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L668] v->counter = temp VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L669] return temp; VAL [\old(i)=1, \result=0, i=1, ldv_global_msg_list={1:0}, temp=0, v={2:12}, v={2:12}] [L674] RET, EXPR ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L674] COND TRUE (ldv_atomic_sub_return(((int) count), (&kref->refcount)) == 0) [L675] CALL release(kref) [L706] const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); [L706] struct ldv_kobject *kobj = ({ const typeof( ((struct ldv_kobject *)0)->kref ) *__mptr = (kref); (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) );}); [L707] CALL ldv_kobject_cleanup(kobj) [L699] EXPR kobj->name VAL [kobj={2:0}, kobj={2:0}, kobj->name={0:0}, ldv_global_msg_list={1:0}] [L699] char *name = kobj->name; [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L700] free(kobj) [L701] COND FALSE !(\read(*name)) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}, name={0:0}] [L707] RET ldv_kobject_cleanup(kobj) [L675] RET release(kref) [L676] return 1; VAL [\old(count)=1, \result=1, count=1, kref={2:12}, kref={2:12}, ldv_global_msg_list={1:0}, release={-1:0}, release={-1:0}] [L690] RET, EXPR ldv_kref_sub(kref, 1, release) [L690] return ldv_kref_sub(kref, 1, release); [L712] RET ldv_kref_put(&kobj->kref, ldv_kobject_release) [L761] RET ldv_kobject_put(kobj) VAL [kobj={2:0}, kobj={2:0}, ldv_global_msg_list={1:0}] [L766] RET f_22_put(kobj) [L767] CALL ldv_kobject_put(kobj) VAL [ldv_global_msg_list={1:0}] [L711] COND TRUE \read(*kobj) [L712] CALL ldv_kref_put(&kobj->kref, ldv_kobject_release) [L690] CALL ldv_kref_sub(kref, 1, release) [L674] CALL ldv_atomic_sub_return(((int) count), (&kref->refcount)) [L665] int temp; VAL [\old(i)=1, i=1, ldv_global_msg_list={1:0}, v={2:12}, v={2:12}] [L666] v->counter - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 78 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 60.9s, OverallIterations: 34, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2061 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2035 mSDsluCounter, 14293 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 822 IncrementalHoareTripleChecker+Unchecked, 12056 mSDsCounter, 367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6543 IncrementalHoareTripleChecker+Invalid, 7732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 367 mSolverCounterUnsat, 2237 mSDtfsCounter, 6543 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1825 GetRequests, 1261 SyntacticMatches, 42 SemanticMatches, 522 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3972 ImplicationChecksByTransitivity, 32.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=25, InterpolantAutomatonStates: 402, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 33 MinimizatonAttempts, 241 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 30.3s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1467 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1581 ConstructedInterpolants, 139 QuantifiedInterpolants, 9899 SizeOfPredicates, 540 NumberOfNonLiveVariables, 9457 ConjunctsInSsa, 1030 ConjunctsInUnsatCore, 40 InterpolantComputations, 26 PerfectInterpolantSequences, 2829/3527 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 RESULT: Ultimate proved your program to be incorrect! [2022-07-21 17:29:19,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)