./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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_test13_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:05:27,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:05:27,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:05:27,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:05:27,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:05:27,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:05:27,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:05:27,122 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:05:27,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:05:27,129 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:05:27,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:05:27,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:05:27,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:05:27,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:05:27,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:05:27,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:05:27,138 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:05:27,139 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:05:27,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:05:27,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:05:27,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:05:27,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:05:27,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:05:27,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:05:27,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:05:27,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:05:27,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:05:27,155 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:05:27,155 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:05:27,156 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:05:27,156 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:05:27,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:05:27,158 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:05:27,159 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:05:27,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:05:27,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:05:27,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:05:27,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:05:27,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:05:27,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:05:27,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:05:27,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:05:27,188 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:05:27,188 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:05:27,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:05:27,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:05:27,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:05:27,191 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:05:27,191 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:05:27,191 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:05:27,192 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:05:27,192 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:05:27,192 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:05:27,193 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:05:27,193 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:05:27,193 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:05:27,193 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:05:27,193 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:05:27,193 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:05:27,194 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:05:27,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:05:27,194 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:05:27,194 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:05:27,194 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:05:27,194 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:05:27,194 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:05:27,195 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:05:27,195 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:05:27,195 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:05:27,195 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:05:27,196 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f [2023-02-15 22:05:27,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:05:27,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:05:27,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:05:27,460 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:05:27,460 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:05:27,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-15 22:05:28,411 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:05:28,657 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:05:28,658 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-15 22:05:28,670 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d842a658/c73c70bc774541c28dc95d8386a0ba71/FLAG81b22c808 [2023-02-15 22:05:28,681 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d842a658/c73c70bc774541c28dc95d8386a0ba71 [2023-02-15 22:05:28,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:05:28,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:05:28,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:05:28,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:05:28,690 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:05:28,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:05:28" (1/1) ... [2023-02-15 22:05:28,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450b335c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:28, skipping insertion in model container [2023-02-15 22:05:28,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:05:28" (1/1) ... [2023-02-15 22:05:28,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:05:28,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:05:29,070 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:05:29,084 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) [2023-02-15 22:05:29,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3d919c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:29, skipping insertion in model container [2023-02-15 22:05:29,085 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:05:29,086 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 22:05:29,088 INFO L158 Benchmark]: Toolchain (without parser) took 400.76ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 90.3MB in the end (delta: -13.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 22:05:29,088 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:05:29,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.13ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 90.3MB in the end (delta: -13.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-02-15 22:05:29,090 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 119.5MB. Free memory is still 92.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.13ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 90.3MB in the end (delta: -13.1MB). Peak memory consumption was 18.9MB. 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_test13_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 22:05:30,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:05:30,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:05:30,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:05:30,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:05:30,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:05:30,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:05:30,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:05:30,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:05:30,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:05:30,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:05:30,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:05:30,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:05:30,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:05:30,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:05:30,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:05:30,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:05:30,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:05:30,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:05:30,766 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:05:30,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:05:30,767 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:05:30,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:05:30,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:05:30,773 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:05:30,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:05:30,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:05:30,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:05:30,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:05:30,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:05:30,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:05:30,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:05:30,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:05:30,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:05:30,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:05:30,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:05:30,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:05:30,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:05:30,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:05:30,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:05:30,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:05:30,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:05:30,814 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:05:30,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:05:30,815 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:05:30,815 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:05:30,816 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:05:30,816 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:05:30,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:05:30,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:05:30,817 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:05:30,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:05:30,817 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:05:30,818 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:05:30,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:05:30,819 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:05:30,819 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:05:30,819 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:05:30,819 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:05:30,819 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:05:30,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:05:30,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:05:30,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:05:30,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:05:30,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:05:30,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:05:30,821 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:05:30,822 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 35bea36500fd584379ee75f7219d833c6e835c74616f49a2cc8d9d16168e8f4f [2023-02-15 22:05:31,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:05:31,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:05:31,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:05:31,128 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:05:31,132 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:05:31,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-15 22:05:32,162 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:05:32,398 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:05:32,399 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_2.i [2023-02-15 22:05:32,413 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31675614/41f5d5fc4ef74776900db360702d05ae/FLAGb438ad17e [2023-02-15 22:05:32,423 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b31675614/41f5d5fc4ef74776900db360702d05ae [2023-02-15 22:05:32,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:05:32,426 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:05:32,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:05:32,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:05:32,430 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:05:32,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:32,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b1e582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32, skipping insertion in model container [2023-02-15 22:05:32,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:32,436 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:05:32,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:05:32,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:05:32,782 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:05:32,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:05:32,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:05:32,855 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:05:32,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:05:32,949 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:05:32,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32 WrapperNode [2023-02-15 22:05:32,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:05:32,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:05:32,950 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:05:32,950 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:05:32,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:32,985 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,007 INFO L138 Inliner]: procedures = 167, calls = 79, calls flagged for inlining = 21, calls inlined = 6, statements flattened = 53 [2023-02-15 22:05:33,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:05:33,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:05:33,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:05:33,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:05:33,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,040 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,048 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,051 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:05:33,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:05:33,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:05:33,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:05:33,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (1/1) ... [2023-02-15 22:05:33,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:05:33,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:05:33,089 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) [2023-02-15 22:05:33,131 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 [2023-02-15 22:05:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-15 22:05:33,148 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-15 22:05:33,148 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 22:05:33,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 22:05:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 22:05:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 22:05:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2023-02-15 22:05:33,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2023-02-15 22:05:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:05:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:05:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:05:33,150 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:05:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:05:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2023-02-15 22:05:33,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2023-02-15 22:05:33,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:05:33,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:05:33,251 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:05:33,253 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:05:33,528 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:05:33,532 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:05:33,533 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 22:05:33,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:05:33 BoogieIcfgContainer [2023-02-15 22:05:33,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:05:33,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:05:33,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:05:33,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:05:33,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:05:32" (1/3) ... [2023-02-15 22:05:33,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628c19b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:05:33, skipping insertion in model container [2023-02-15 22:05:33,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:05:32" (2/3) ... [2023-02-15 22:05:33,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628c19b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:05:33, skipping insertion in model container [2023-02-15 22:05:33,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:05:33" (3/3) ... [2023-02-15 22:05:33,546 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_2.i [2023-02-15 22:05:33,559 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:05:33,559 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-02-15 22:05:33,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:05:33,606 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@496f7f80, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:05:33,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-02-15 22:05:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:33,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:05:33,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:33,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:33,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1285123929, now seen corresponding path program 1 times [2023-02-15 22:05:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:33,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725080448] [2023-02-15 22:05:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:33,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:33,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:33,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:33,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 22:05:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:33,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:05:33,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:33,814 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:05:33,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 22:05:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:33,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:33,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:33,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725080448] [2023-02-15 22:05:33,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725080448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:33,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:33,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:33,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700831825] [2023-02-15 22:05:33,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:33,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:05:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:33,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:05:33,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=30, Unknown=1, NotChecked=0, Total=42 [2023-02-15 22:05:33,885 INFO L87 Difference]: Start difference. First operand has 82 states, 42 states have (on average 1.7857142857142858) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 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) [2023-02-15 22:05:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:34,285 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2023-02-15 22:05:34,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:05:34,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 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 12 [2023-02-15 22:05:34,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:34,293 INFO L225 Difference]: With dead ends: 82 [2023-02-15 22:05:34,293 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 22:05:34,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=70, Unknown=1, NotChecked=0, Total=110 [2023-02-15 22:05:34,302 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 170 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 17 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:34,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 70 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 201 Invalid, 30 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:05:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 22:05:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2023-02-15 22:05:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 68 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2023-02-15 22:05:34,329 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 12 [2023-02-15 22:05:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:34,329 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2023-02-15 22:05:34,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 1 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) [2023-02-15 22:05:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2023-02-15 22:05:34,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:05:34,330 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:34,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:34,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:34,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:34,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1285123928, now seen corresponding path program 1 times [2023-02-15 22:05:34,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:34,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907826473] [2023-02-15 22:05:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:34,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:34,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:34,540 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:34,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 22:05:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:34,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:05:34,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:36,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:36,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:05:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:36,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:36,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:36,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907826473] [2023-02-15 22:05:36,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907826473] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:36,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:36,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:05:36,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021813011] [2023-02-15 22:05:36,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:36,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:05:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:05:36,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=40, Unknown=2, NotChecked=0, Total=56 [2023-02-15 22:05:36,869 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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) [2023-02-15 22:05:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:39,432 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2023-02-15 22:05:39,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:05:39,432 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 12 [2023-02-15 22:05:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:39,433 INFO L225 Difference]: With dead ends: 78 [2023-02-15 22:05:39,433 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 22:05:39,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=48, Invalid=106, Unknown=2, NotChecked=0, Total=156 [2023-02-15 22:05:39,434 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 185 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 34 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:39,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 71 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 250 Invalid, 5 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:05:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 22:05:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-02-15 22:05:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 66 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2023-02-15 22:05:39,440 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 12 [2023-02-15 22:05:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:39,440 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2023-02-15 22:05:39,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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) [2023-02-15 22:05:39,440 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2023-02-15 22:05:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:05:39,441 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:39,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:39,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:39,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:39,642 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:39,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash 211575775, now seen corresponding path program 1 times [2023-02-15 22:05:39,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:39,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313422486] [2023-02-15 22:05:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:39,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:39,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:39,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 22:05:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:39,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:05:39,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:39,794 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:39,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:39,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:39,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313422486] [2023-02-15 22:05:39,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313422486] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:39,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:39,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:05:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913727839] [2023-02-15 22:05:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:39,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:05:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:39,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:05:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:05:39,835 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:40,174 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2023-02-15 22:05:40,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:05:40,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-15 22:05:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:40,176 INFO L225 Difference]: With dead ends: 109 [2023-02-15 22:05:40,176 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:05:40,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:05:40,177 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:40,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 314 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:05:40,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:05:40,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 75. [2023-02-15 22:05:40,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 65 states have internal predecessors, (67), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2023-02-15 22:05:40,184 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 15 [2023-02-15 22:05:40,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:40,184 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2023-02-15 22:05:40,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:40,184 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2023-02-15 22:05:40,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-15 22:05:40,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:40,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:40,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:40,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:40,389 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:40,390 INFO L85 PathProgramCache]: Analyzing trace with hash 211575776, now seen corresponding path program 1 times [2023-02-15 22:05:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:40,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357416063] [2023-02-15 22:05:40,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:40,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:40,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:40,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:40,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 22:05:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:40,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 22:05:40,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:42,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:05:42,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:05:42,719 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:42,725 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:42,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:42,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:42,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357416063] [2023-02-15 22:05:42,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357416063] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:42,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:42,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:05:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594449074] [2023-02-15 22:05:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:42,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:05:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:42,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:05:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=88, Unknown=2, NotChecked=0, Total=110 [2023-02-15 22:05:42,784 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:47,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:47,761 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2023-02-15 22:05:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:05:47,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-02-15 22:05:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:47,766 INFO L225 Difference]: With dead ends: 105 [2023-02-15 22:05:47,766 INFO L226 Difference]: Without dead ends: 105 [2023-02-15 22:05:47,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=100, Invalid=318, Unknown=2, NotChecked=0, Total=420 [2023-02-15 22:05:47,767 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 93 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:47,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 243 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 455 Invalid, 3 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:05:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-02-15 22:05:47,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 74. [2023-02-15 22:05:47,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:47,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-02-15 22:05:47,771 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 15 [2023-02-15 22:05:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:47,771 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-02-15 22:05:47,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:47,772 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-02-15 22:05:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:05:47,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:47,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:47,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:47,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:47,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:47,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1183663415, now seen corresponding path program 1 times [2023-02-15 22:05:47,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:47,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651452927] [2023-02-15 22:05:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:47,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:47,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:47,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:47,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 22:05:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:48,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:05:48,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:48,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:48,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:48,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651452927] [2023-02-15 22:05:48,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651452927] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:48,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:48,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:48,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873737523] [2023-02-15 22:05:48,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:48,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:48,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:48,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:48,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:48,055 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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) [2023-02-15 22:05:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:48,076 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2023-02-15 22:05:48,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:48,077 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), 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 13 [2023-02-15 22:05:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:48,079 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:05:48,079 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:05:48,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:48,083 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 18 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:48,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 355 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:05:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:05:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2023-02-15 22:05:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 67 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2023-02-15 22:05:48,093 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 13 [2023-02-15 22:05:48,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:48,093 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2023-02-15 22:05:48,093 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), 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) [2023-02-15 22:05:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2023-02-15 22:05:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:05:48,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:48,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:48,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:48,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:48,300 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:48,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849418, now seen corresponding path program 1 times [2023-02-15 22:05:48,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:48,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212882724] [2023-02-15 22:05:48,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:48,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:48,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:48,303 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:48,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 22:05:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:48,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:05:48,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:48,497 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:48,502 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:48,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:48,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:48,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212882724] [2023-02-15 22:05:48,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212882724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:48,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:48,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:05:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331025276] [2023-02-15 22:05:48,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:48,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:05:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:48,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:05:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:05:48,545 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-02-15 22:05:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:48,882 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2023-02-15 22:05:48,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:05:48,883 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), 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 13 [2023-02-15 22:05:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:48,883 INFO L225 Difference]: With dead ends: 103 [2023-02-15 22:05:48,883 INFO L226 Difference]: Without dead ends: 103 [2023-02-15 22:05:48,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:48,884 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 36 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:48,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 212 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:05:48,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-15 22:05:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 84. [2023-02-15 22:05:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.52) internal successors, (76), 72 states have internal predecessors, (76), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2023-02-15 22:05:48,888 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 13 [2023-02-15 22:05:48,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:48,888 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2023-02-15 22:05:48,889 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), 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) [2023-02-15 22:05:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2023-02-15 22:05:48,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:05:48,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:48,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:48,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:49,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:49,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:49,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1303849417, now seen corresponding path program 1 times [2023-02-15 22:05:49,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:49,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298704727] [2023-02-15 22:05:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:49,098 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:49,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 22:05:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:49,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:05:49,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:49,218 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:49,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:49,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:49,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298704727] [2023-02-15 22:05:49,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [298704727] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:49,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:49,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:05:49,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816023664] [2023-02-15 22:05:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:49,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:05:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:05:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:05:49,241 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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) [2023-02-15 22:05:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:49,520 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2023-02-15 22:05:49,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:49,520 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), 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 13 [2023-02-15 22:05:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:49,521 INFO L225 Difference]: With dead ends: 98 [2023-02-15 22:05:49,521 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 22:05:49,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:49,522 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:49,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 162 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:05:49,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 22:05:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2023-02-15 22:05:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.5) internal successors, (75), 72 states have internal predecessors, (75), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2023-02-15 22:05:49,528 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 13 [2023-02-15 22:05:49,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:49,528 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2023-02-15 22:05:49,528 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), 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) [2023-02-15 22:05:49,528 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2023-02-15 22:05:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:05:49,529 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:49,529 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:49,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:49,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:49,734 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:49,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2031085508, now seen corresponding path program 1 times [2023-02-15 22:05:49,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:49,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204246510] [2023-02-15 22:05:49,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:49,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:49,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:49,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:49,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 22:05:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:49,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:05:49,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:49,805 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:49,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:49,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:49,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204246510] [2023-02-15 22:05:49,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204246510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:49,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:49,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:05:49,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153717032] [2023-02-15 22:05:49,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:49,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:05:49,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:49,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:05:49,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:49,903 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:50,370 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2023-02-15 22:05:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:05:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:05:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:50,371 INFO L225 Difference]: With dead ends: 120 [2023-02-15 22:05:50,371 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 22:05:50,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:05:50,371 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:50,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 378 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:05:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 22:05:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 97. [2023-02-15 22:05:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 82 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:05:50,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-02-15 22:05:50,375 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 16 [2023-02-15 22:05:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:50,375 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-02-15 22:05:50,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-02-15 22:05:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:05:50,376 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:50,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:50,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:50,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:50,577 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2031085507, now seen corresponding path program 1 times [2023-02-15 22:05:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:50,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981626814] [2023-02-15 22:05:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:50,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:50,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:50,579 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:50,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 22:05:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:50,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:05:50,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:50,658 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:50,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:50,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:50,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981626814] [2023-02-15 22:05:50,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981626814] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:50,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:50,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:05:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848539916] [2023-02-15 22:05:50,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:50,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:05:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:50,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:05:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:05:50,773 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:51,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:51,194 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2023-02-15 22:05:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:05:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:05:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:51,195 INFO L225 Difference]: With dead ends: 118 [2023-02-15 22:05:51,195 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 22:05:51,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:05:51,196 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:51,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 477 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:05:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 22:05:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2023-02-15 22:05:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 82 states have internal predecessors, (86), 7 states have call successors, (7), 7 states have call predecessors, (7), 8 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:05:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2023-02-15 22:05:51,205 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 16 [2023-02-15 22:05:51,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:51,205 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2023-02-15 22:05:51,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:51,205 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2023-02-15 22:05:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 22:05:51,206 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:51,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:51,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:51,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:51,409 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1902002789, now seen corresponding path program 1 times [2023-02-15 22:05:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:51,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793222181] [2023-02-15 22:05:51,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:51,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:51,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:51,421 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:51,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 22:05:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:51,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:05:51,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:51,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:51,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:51,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793222181] [2023-02-15 22:05:51,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793222181] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:51,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:51,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:05:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348247407] [2023-02-15 22:05:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:51,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:51,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:51,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:51,509 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:51,524 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2023-02-15 22:05:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:51,526 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-15 22:05:51,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:51,526 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:05:51,526 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 22:05:51,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:51,527 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:51,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 284 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:05:51,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 22:05:51,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2023-02-15 22:05:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.4) internal successors, (70), 68 states have internal predecessors, (70), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:51,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2023-02-15 22:05:51,529 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 16 [2023-02-15 22:05:51,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:51,530 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2023-02-15 22:05:51,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:51,530 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2023-02-15 22:05:51,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:05:51,530 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:51,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:51,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:51,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:51,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:51,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1958018817, now seen corresponding path program 1 times [2023-02-15 22:05:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:51,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994318077] [2023-02-15 22:05:51,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:51,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:51,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:51,743 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:51,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 22:05:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:51,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:05:51,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:51,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:51,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994318077] [2023-02-15 22:05:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994318077] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:51,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:05:51,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828612112] [2023-02-15 22:05:51,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:51,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:05:51,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:51,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:05:51,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:05:51,830 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:51,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:51,938 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2023-02-15 22:05:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:05:51,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 22:05:51,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:51,940 INFO L225 Difference]: With dead ends: 79 [2023-02-15 22:05:51,940 INFO L226 Difference]: Without dead ends: 79 [2023-02-15 22:05:51,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:05:51,940 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:51,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:05:51,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-02-15 22:05:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-02-15 22:05:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.38) internal successors, (69), 67 states have internal predecessors, (69), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2023-02-15 22:05:51,943 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 18 [2023-02-15 22:05:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:51,943 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2023-02-15 22:05:51,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2023-02-15 22:05:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 22:05:51,943 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:51,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:51,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:52,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:52,144 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1958018816, now seen corresponding path program 1 times [2023-02-15 22:05:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:52,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279365866] [2023-02-15 22:05:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:52,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:52,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:52,146 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:52,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 22:05:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:52,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:05:52,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:52,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:52,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:52,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279365866] [2023-02-15 22:05:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279365866] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:05:52,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095865006] [2023-02-15 22:05:52,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:05:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:05:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:05:52,294 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:52,524 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2023-02-15 22:05:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:05:52,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-02-15 22:05:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:52,525 INFO L225 Difference]: With dead ends: 78 [2023-02-15 22:05:52,525 INFO L226 Difference]: Without dead ends: 78 [2023-02-15 22:05:52,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:05:52,526 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 72 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:52,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 280 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:05:52,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-02-15 22:05:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-02-15 22:05:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 66 states have internal predecessors, (68), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2023-02-15 22:05:52,528 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 18 [2023-02-15 22:05:52,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:52,528 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2023-02-15 22:05:52,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:05:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2023-02-15 22:05:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:05:52,528 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:52,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:52,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:52,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:52,737 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:52,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1449226599, now seen corresponding path program 1 times [2023-02-15 22:05:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:52,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642970372] [2023-02-15 22:05:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:52,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:52,739 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:52,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 22:05:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:52,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:05:52,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:52,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:52,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:52,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642970372] [2023-02-15 22:05:52,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642970372] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:52,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:52,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:05:52,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58682054] [2023-02-15 22:05:52,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:52,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:05:52,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:52,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:05:52,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:05:52,899 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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) [2023-02-15 22:05:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:53,088 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2023-02-15 22:05:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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 19 [2023-02-15 22:05:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:53,090 INFO L225 Difference]: With dead ends: 76 [2023-02-15 22:05:53,090 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 22:05:53,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:53,090 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 94 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:53,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 67 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:05:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 22:05:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-02-15 22:05:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.32) internal successors, (66), 64 states have internal predecessors, (66), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:05:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-15 22:05:53,092 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 19 [2023-02-15 22:05:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:53,092 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-15 22:05:53,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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) [2023-02-15 22:05:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-15 22:05:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:05:53,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:53,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:53,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:53,293 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1449226600, now seen corresponding path program 1 times [2023-02-15 22:05:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:53,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319436537] [2023-02-15 22:05:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:53,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:53,295 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:53,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 22:05:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:53,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:05:53,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:53,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:53,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:53,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:53,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319436537] [2023-02-15 22:05:53,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319436537] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:53,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:53,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:05:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212505715] [2023-02-15 22:05:53,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:53,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:05:53,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:05:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:05:53,567 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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) [2023-02-15 22:05:53,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:53,809 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2023-02-15 22:05:53,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:05:53,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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 19 [2023-02-15 22:05:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:53,810 INFO L225 Difference]: With dead ends: 86 [2023-02-15 22:05:53,810 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 22:05:53,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:05:53,810 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:53,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 201 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:05:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 22:05:53,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2023-02-15 22:05:53,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.290909090909091) internal successors, (71), 70 states have internal predecessors, (71), 6 states have call successors, (6), 6 states have call predecessors, (6), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 22:05:53,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2023-02-15 22:05:53,812 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 19 [2023-02-15 22:05:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:53,813 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2023-02-15 22:05:53,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 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) [2023-02-15 22:05:53,813 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2023-02-15 22:05:53,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 22:05:53,813 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:53,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:53,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:54,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:54,025 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:54,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:54,026 INFO L85 PathProgramCache]: Analyzing trace with hash 59862981, now seen corresponding path program 1 times [2023-02-15 22:05:54,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:54,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896543560] [2023-02-15 22:05:54,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:54,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:54,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:54,027 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:54,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 22:05:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:54,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:05:54,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:54,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:54,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:54,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:54,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896543560] [2023-02-15 22:05:54,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896543560] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:54,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:54,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:05:54,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646039019] [2023-02-15 22:05:54,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:54,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:05:54,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:54,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:05:54,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:05:54,117 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:05:54,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:54,237 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2023-02-15 22:05:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:05:54,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 22:05:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:54,238 INFO L225 Difference]: With dead ends: 85 [2023-02-15 22:05:54,238 INFO L226 Difference]: Without dead ends: 66 [2023-02-15 22:05:54,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:05:54,239 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:54,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 69 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:05:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-02-15 22:05:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-02-15 22:05:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 55 states have internal predecessors, (56), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2023-02-15 22:05:54,248 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 24 [2023-02-15 22:05:54,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:54,248 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2023-02-15 22:05:54,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:05:54,248 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2023-02-15 22:05:54,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:05:54,249 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:54,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:54,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:54,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:54,458 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:54,459 INFO L85 PathProgramCache]: Analyzing trace with hash -929247957, now seen corresponding path program 1 times [2023-02-15 22:05:54,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:54,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145832799] [2023-02-15 22:05:54,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:54,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:54,460 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:54,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 22:05:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:54,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 22:05:54,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:54,553 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:54,764 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:54,771 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:54,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:05:54,908 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:54,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:54,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:54,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:54,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145832799] [2023-02-15 22:05:54,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145832799] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:54,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:54,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-02-15 22:05:54,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253459821] [2023-02-15 22:05:54,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:54,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:05:54,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:54,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:05:54,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:05:54,963 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:05:55,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:55,823 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-15 22:05:55,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:05:55,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-15 22:05:55,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:55,824 INFO L225 Difference]: With dead ends: 87 [2023-02-15 22:05:55,824 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 22:05:55,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:05:55,825 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 80 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:55,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 284 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:05:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 22:05:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 65. [2023-02-15 22:05:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 54 states have internal predecessors, (55), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2023-02-15 22:05:55,827 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 27 [2023-02-15 22:05:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:55,827 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2023-02-15 22:05:55,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:05:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2023-02-15 22:05:55,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:05:55,828 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:55,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:55,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:56,028 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:56,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash -929247958, now seen corresponding path program 1 times [2023-02-15 22:05:56,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:56,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153505619] [2023-02-15 22:05:56,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:56,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:56,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:56,045 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:56,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 22:05:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:56,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 22:05:56,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:56,144 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:56,275 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:56,362 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 22:05:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:56,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:56,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:56,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153505619] [2023-02-15 22:05:56,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153505619] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:56,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:56,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 22:05:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262539648] [2023-02-15 22:05:56,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:56,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:05:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:56,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:05:56,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:05:56,400 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:05:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:57,189 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2023-02-15 22:05:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:05:57,190 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2023-02-15 22:05:57,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:57,190 INFO L225 Difference]: With dead ends: 90 [2023-02-15 22:05:57,190 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 22:05:57,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:05:57,191 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 127 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:57,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 265 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:05:57,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 22:05:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2023-02-15 22:05:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 53 states have internal predecessors, (54), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:05:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2023-02-15 22:05:57,193 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 27 [2023-02-15 22:05:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:57,193 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2023-02-15 22:05:57,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:05:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2023-02-15 22:05:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:05:57,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:57,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:57,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:57,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:57,395 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:57,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:57,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1379353082, now seen corresponding path program 1 times [2023-02-15 22:05:57,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:57,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143176356] [2023-02-15 22:05:57,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:57,397 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:57,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 22:05:57,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:57,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:05:57,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:57,486 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 22:05:57,634 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:57,737 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 22:05:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:57,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:57,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:57,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143176356] [2023-02-15 22:05:57,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143176356] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:57,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:57,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 22:05:57,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704582237] [2023-02-15 22:05:57,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:57,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:05:57,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:57,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:05:57,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:05:57,820 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:05:58,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:05:58,793 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2023-02-15 22:05:58,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:05:58,793 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 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 32 [2023-02-15 22:05:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:05:58,794 INFO L225 Difference]: With dead ends: 93 [2023-02-15 22:05:58,794 INFO L226 Difference]: Without dead ends: 93 [2023-02-15 22:05:58,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2023-02-15 22:05:58,795 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:05:58,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 276 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:05:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-02-15 22:05:58,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2023-02-15 22:05:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 62 states have internal predecessors, (69), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:05:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2023-02-15 22:05:58,797 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 32 [2023-02-15 22:05:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:05:58,797 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2023-02-15 22:05:58,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:05:58,797 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2023-02-15 22:05:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:05:58,797 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:05:58,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:05:58,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:05:58,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:58,998 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:05:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:05:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1379353083, now seen corresponding path program 1 times [2023-02-15 22:05:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:05:58,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534231003] [2023-02-15 22:05:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:05:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:05:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:05:59,000 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:05:59,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 22:05:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:05:59,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 22:05:59,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:05:59,098 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:59,288 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:59,293 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:59,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:05:59,433 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:05:59,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:05:59,551 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:05:59,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:05:59,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534231003] [2023-02-15 22:05:59,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534231003] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:05:59,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:05:59,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-15 22:05:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039969496] [2023-02-15 22:05:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:05:59,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:05:59,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:05:59,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:05:59,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-02-15 22:05:59,552 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:00,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:00,611 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2023-02-15 22:06:00,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:06:00,612 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 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 32 [2023-02-15 22:06:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:00,612 INFO L225 Difference]: With dead ends: 87 [2023-02-15 22:06:00,612 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 22:06:00,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:06:00,613 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:00,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 317 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 22:06:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 22:06:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2023-02-15 22:06:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.34) internal successors, (67), 62 states have internal predecessors, (67), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-02-15 22:06:00,615 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 32 [2023-02-15 22:06:00,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:00,615 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-02-15 22:06:00,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 13 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-02-15 22:06:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 22:06:00,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:00,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:00,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:00,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:00,816 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:00,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:00,817 INFO L85 PathProgramCache]: Analyzing trace with hash -193116151, now seen corresponding path program 1 times [2023-02-15 22:06:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:00,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48821237] [2023-02-15 22:06:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:00,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:00,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:00,818 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:00,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 22:06:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:00,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 22:06:00,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:01,069 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:01,162 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:01,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:01,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:01,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48821237] [2023-02-15 22:06:01,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48821237] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:01,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:01,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 22:06:01,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773873008] [2023-02-15 22:06:01,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:01,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:06:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:06:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:06:01,211 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 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) [2023-02-15 22:06:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:01,625 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2023-02-15 22:06:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:06:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 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 33 [2023-02-15 22:06:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:01,626 INFO L225 Difference]: With dead ends: 77 [2023-02-15 22:06:01,626 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:06:01,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:06:01,626 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 76 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:01,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 372 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:06:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:06:01,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-02-15 22:06:01,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.32) internal successors, (66), 62 states have internal predecessors, (66), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2023-02-15 22:06:01,628 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 33 [2023-02-15 22:06:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:01,628 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2023-02-15 22:06:01,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 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) [2023-02-15 22:06:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2023-02-15 22:06:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:06:01,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:01,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:01,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:01,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:01,829 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1939380463, now seen corresponding path program 1 times [2023-02-15 22:06:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:01,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407848952] [2023-02-15 22:06:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:01,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:01,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:01,831 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:01,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 22:06:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:01,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 22:06:01,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:02,015 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:02,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:06:02,083 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:06:02,281 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:02,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:06:02,352 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:02,374 INFO L321 Elim1Store]: treesize reduction 25, result has 47.9 percent of original size [2023-02-15 22:06:02,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 34 [2023-02-15 22:06:02,583 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-02-15 22:06:02,637 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2023-02-15 22:06:02,865 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:06:02,866 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2023-02-15 22:06:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:02,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:02,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:02,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407848952] [2023-02-15 22:06:02,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407848952] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:02,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:02,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-15 22:06:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529102804] [2023-02-15 22:06:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:02,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 22:06:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:02,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 22:06:02,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:06:02,931 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:06,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:08,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:08,997 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-15 22:06:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:06:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 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 35 [2023-02-15 22:06:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:08,998 INFO L225 Difference]: With dead ends: 77 [2023-02-15 22:06:08,998 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:06:08,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 22:06:08,999 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 21 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:09,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 338 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 822 Invalid, 5 Unknown, 0 Unchecked, 5.1s Time] [2023-02-15 22:06:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:06:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2023-02-15 22:06:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 62 states have internal predecessors, (65), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2023-02-15 22:06:09,004 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2023-02-15 22:06:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:09,004 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2023-02-15 22:06:09,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.4) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2023-02-15 22:06:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 22:06:09,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:09,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:09,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:09,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:09,213 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:09,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1939380462, now seen corresponding path program 1 times [2023-02-15 22:06:09,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:09,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384105181] [2023-02-15 22:06:09,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:09,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:09,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:09,216 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:09,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 22:06:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:09,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 22:06:09,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:09,453 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:09,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:06:09,524 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:06:09,530 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:06:09,800 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:09,816 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:09,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:06:09,902 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:09,961 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:06:09,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 22:06:10,000 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:06:10,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 22:06:10,373 INFO L350 Elim1Store]: Elim1 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 58 treesize of output 46 [2023-02-15 22:06:10,378 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 42 [2023-02-15 22:06:10,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 32 [2023-02-15 22:06:10,773 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:06:10,773 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2023-02-15 22:06:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:10,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:10,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:10,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384105181] [2023-02-15 22:06:10,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384105181] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:10,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:10,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-02-15 22:06:10,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835122714] [2023-02-15 22:06:10,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:10,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 22:06:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:10,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 22:06:10,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2023-02-15 22:06:10,861 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:13,341 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2023-02-15 22:06:13,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 22:06:13,343 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 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 35 [2023-02-15 22:06:13,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:13,343 INFO L225 Difference]: With dead ends: 76 [2023-02-15 22:06:13,343 INFO L226 Difference]: Without dead ends: 76 [2023-02-15 22:06:13,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=193, Invalid=1529, Unknown=0, NotChecked=0, Total=1722 [2023-02-15 22:06:13,344 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:13,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 431 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:06:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-15 22:06:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-02-15 22:06:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.28) internal successors, (64), 62 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2023-02-15 22:06:13,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 35 [2023-02-15 22:06:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:13,346 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2023-02-15 22:06:13,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 18 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:13,346 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2023-02-15 22:06:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 22:06:13,347 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:13,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:13,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:13,557 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash 8747840, now seen corresponding path program 1 times [2023-02-15 22:06:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:13,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841096933] [2023-02-15 22:06:13,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:13,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:13,560 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:13,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-15 22:06:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:13,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 22:06:13,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:13,748 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:13,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:06:13,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:06:13,999 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-15 22:06:13,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 34 [2023-02-15 22:06:14,012 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:14,257 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 17 [2023-02-15 22:06:14,480 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:06:14,480 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 14 [2023-02-15 22:06:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:14,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:14,545 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:14,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841096933] [2023-02-15 22:06:14,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841096933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:14,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:14,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-15 22:06:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039870084] [2023-02-15 22:06:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:14,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 22:06:14,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 22:06:14,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2023-02-15 22:06:14,546 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:18,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:20,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:06:20,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:20,650 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2023-02-15 22:06:20,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:06:20,651 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 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 36 [2023-02-15 22:06:20,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:20,652 INFO L225 Difference]: With dead ends: 75 [2023-02-15 22:06:20,652 INFO L226 Difference]: Without dead ends: 75 [2023-02-15 22:06:20,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=244, Invalid=1396, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 22:06:20,652 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 188 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 37 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:20,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 134 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 799 Invalid, 9 Unknown, 0 Unchecked, 5.1s Time] [2023-02-15 22:06:20,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-02-15 22:06:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2023-02-15 22:06:20,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.26) internal successors, (63), 62 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2023-02-15 22:06:20,654 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 36 [2023-02-15 22:06:20,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:20,654 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2023-02-15 22:06:20,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2023-02-15 22:06:20,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 22:06:20,655 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:20,655 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:20,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:20,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:20,855 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:20,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:20,856 INFO L85 PathProgramCache]: Analyzing trace with hash 8747841, now seen corresponding path program 1 times [2023-02-15 22:06:20,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:20,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824024544] [2023-02-15 22:06:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:20,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:20,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:20,858 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:20,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-15 22:06:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:20,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 54 conjunts are in the unsatisfiable core [2023-02-15 22:06:20,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:21,056 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:21,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:06:21,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:06:21,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:06:22,324 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-15 22:06:22,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-02-15 22:06:24,787 INFO L321 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2023-02-15 22:06:24,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 22:06:25,560 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 22:06:25,561 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 40 [2023-02-15 22:06:25,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2023-02-15 22:06:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:25,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:25,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:25,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824024544] [2023-02-15 22:06:25,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824024544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:25,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:25,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-15 22:06:25,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243815610] [2023-02-15 22:06:25,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:25,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 22:06:25,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:25,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 22:06:25,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2023-02-15 22:06:25,658 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:41,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 22:06:42,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:42,496 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2023-02-15 22:06:42,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:06:42,497 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 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 36 [2023-02-15 22:06:42,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:42,497 INFO L225 Difference]: With dead ends: 74 [2023-02-15 22:06:42,497 INFO L226 Difference]: Without dead ends: 74 [2023-02-15 22:06:42,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 22:06:42,498 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 143 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:42,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 138 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-15 22:06:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-02-15 22:06:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-02-15 22:06:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.24) internal successors, (62), 62 states have internal predecessors, (62), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2023-02-15 22:06:42,500 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 36 [2023-02-15 22:06:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:42,500 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2023-02-15 22:06:42,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 17 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 22:06:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2023-02-15 22:06:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:06:42,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:42,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:42,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:42,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:42,708 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash -555084404, now seen corresponding path program 1 times [2023-02-15 22:06:42,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:42,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664789352] [2023-02-15 22:06:42,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:42,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:42,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:42,710 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:42,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-15 22:06:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:42,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:06:42,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:42,912 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 22:06:42,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:42,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:42,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:42,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664789352] [2023-02-15 22:06:42,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664789352] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:42,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:42,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 22:06:42,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518593243] [2023-02-15 22:06:42,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:42,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:06:42,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:42,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:06:42,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:06:42,933 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:06:43,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:43,339 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-15 22:06:43,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:06:43,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2023-02-15 22:06:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:43,340 INFO L225 Difference]: With dead ends: 77 [2023-02-15 22:06:43,341 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:06:43,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:06:43,341 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:43,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 242 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:06:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:06:43,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-02-15 22:06:43,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.25) internal successors, (65), 63 states have internal predecessors, (65), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:43,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2023-02-15 22:06:43,343 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 41 [2023-02-15 22:06:43,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:43,343 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2023-02-15 22:06:43,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:06:43,343 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2023-02-15 22:06:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:06:43,343 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:43,343 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:43,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:43,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:43,544 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash -555084403, now seen corresponding path program 1 times [2023-02-15 22:06:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:43,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274568118] [2023-02-15 22:06:43,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:43,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:43,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:43,546 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:43,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-15 22:06:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:43,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-15 22:06:43,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:43,797 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:06:43,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:06:43,857 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:06:43,863 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:06:44,080 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:44,087 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:44,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:06:44,147 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:06:44,205 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:06:44,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 22:06:44,235 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:06:44,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 22:06:44,476 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-02-15 22:06:44,485 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-02-15 22:06:45,618 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 22:06:45,619 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 53 [2023-02-15 22:06:45,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 19 [2023-02-15 22:06:45,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:45,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:06:45,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:45,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274568118] [2023-02-15 22:06:45,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274568118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:06:45,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:06:45,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-02-15 22:06:45,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035803841] [2023-02-15 22:06:45,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:06:45,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:06:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:45,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:06:45,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:06:45,703 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 26 states, 24 states have (on average 1.375) internal successors, (33), 21 states have internal predecessors, (33), 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) [2023-02-15 22:06:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:48,691 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2023-02-15 22:06:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 22:06:48,692 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.375) internal successors, (33), 21 states have internal predecessors, (33), 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) Word has length 41 [2023-02-15 22:06:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:48,692 INFO L225 Difference]: With dead ends: 77 [2023-02-15 22:06:48,692 INFO L226 Difference]: Without dead ends: 77 [2023-02-15 22:06:48,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=242, Invalid=2208, Unknown=0, NotChecked=0, Total=2450 [2023-02-15 22:06:48,693 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 120 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:48,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 359 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-02-15 22:06:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-02-15 22:06:48,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2023-02-15 22:06:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 63 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:06:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2023-02-15 22:06:48,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 41 [2023-02-15 22:06:48,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:48,695 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2023-02-15 22:06:48,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.375) internal successors, (33), 21 states have internal predecessors, (33), 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) [2023-02-15 22:06:48,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2023-02-15 22:06:48,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:06:48,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:48,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:48,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-02-15 22:06:48,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:48,903 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:48,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:48,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1459271833, now seen corresponding path program 1 times [2023-02-15 22:06:48,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:48,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27831010] [2023-02-15 22:06:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:48,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:48,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:48,905 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:48,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-15 22:06:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:49,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:06:49,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:49,138 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 11 [2023-02-15 22:06:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:49,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:49,294 INFO L321 Elim1Store]: treesize reduction 7, result has 56.3 percent of original size [2023-02-15 22:06:49,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2023-02-15 22:06:49,319 INFO L321 Elim1Store]: treesize reduction 7, result has 50.0 percent of original size [2023-02-15 22:06:49,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2023-02-15 22:06:49,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:49,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:49,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27831010] [2023-02-15 22:06:49,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27831010] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:06:49,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:49,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2023-02-15 22:06:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157018847] [2023-02-15 22:06:49,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:49,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:06:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:06:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:06:49,387 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:06:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:06:50,088 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-15 22:06:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:06:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2023-02-15 22:06:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:06:50,089 INFO L225 Difference]: With dead ends: 87 [2023-02-15 22:06:50,089 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 22:06:50,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2023-02-15 22:06:50,090 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:06:50,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 326 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:06:50,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 22:06:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2023-02-15 22:06:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.25) internal successors, (70), 67 states have internal predecessors, (70), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 22:06:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2023-02-15 22:06:50,092 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 46 [2023-02-15 22:06:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:06:50,092 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2023-02-15 22:06:50,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.857142857142857) internal successors, (40), 11 states have internal predecessors, (40), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:06:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2023-02-15 22:06:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:06:50,093 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:06:50,093 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:06:50,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-15 22:06:50,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:50,301 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:06:50,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:06:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1459271832, now seen corresponding path program 1 times [2023-02-15 22:06:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:06:50,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589691241] [2023-02-15 22:06:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:06:50,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:06:50,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:06:50,303 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:06:50,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-15 22:06:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:06:50,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 22:06:50,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:06:50,722 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 17 [2023-02-15 22:06:50,724 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 20 [2023-02-15 22:06:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:51,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:06:51,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:06:51,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 40 [2023-02-15 22:06:52,836 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:06:52,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2023-02-15 22:06:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:06:55,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:06:55,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589691241] [2023-02-15 22:06:55,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589691241] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:06:55,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:06:55,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-15 22:06:55,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990492964] [2023-02-15 22:06:55,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:06:55,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:06:55,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:06:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:06:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2023-02-15 22:06:55,690 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:07:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:01,172 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2023-02-15 22:07:01,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:07:01,174 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2023-02-15 22:07:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:01,174 INFO L225 Difference]: With dead ends: 87 [2023-02-15 22:07:01,174 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 22:07:01,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2023-02-15 22:07:01,175 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 79 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:01,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 537 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-02-15 22:07:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 22:07:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-02-15 22:07:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 68 states have internal predecessors, (70), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 22:07:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2023-02-15 22:07:01,184 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 46 [2023-02-15 22:07:01,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:01,184 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2023-02-15 22:07:01,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.16) internal successors, (54), 20 states have internal predecessors, (54), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-02-15 22:07:01,184 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2023-02-15 22:07:01,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 22:07:01,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:01,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:01,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:01,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:01,393 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:07:01,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2003824700, now seen corresponding path program 1 times [2023-02-15 22:07:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:01,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413577965] [2023-02-15 22:07:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:01,395 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:01,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-15 22:07:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:01,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:07:01,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:07:01,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:01,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:01,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413577965] [2023-02-15 22:07:01,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413577965] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:01,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:01,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:07:01,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536757183] [2023-02-15 22:07:01,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:01,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:07:01,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:07:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:07:01,752 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:07:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:02,066 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2023-02-15 22:07:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:07:02,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 47 [2023-02-15 22:07:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:02,067 INFO L225 Difference]: With dead ends: 81 [2023-02-15 22:07:02,067 INFO L226 Difference]: Without dead ends: 81 [2023-02-15 22:07:02,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:07:02,068 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 33 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:02,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 152 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:07:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-02-15 22:07:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-02-15 22:07:02,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 67 states have internal predecessors, (69), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 22:07:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2023-02-15 22:07:02,079 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 47 [2023-02-15 22:07:02,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:02,080 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2023-02-15 22:07:02,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:07:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2023-02-15 22:07:02,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:07:02,080 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:02,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:02,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-02-15 22:07:02,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:02,285 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:07:02,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:02,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1989023560, now seen corresponding path program 1 times [2023-02-15 22:07:02,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:02,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524260130] [2023-02-15 22:07:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:02,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:02,287 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:02,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-15 22:07:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:02,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 22:07:02,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:02,496 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:07:02,502 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:07:02,684 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2023-02-15 22:07:02,687 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 11 [2023-02-15 22:07:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:07:02,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:07:02,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:02,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524260130] [2023-02-15 22:07:02,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524260130] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:07:02,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:07:02,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:07:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458484681] [2023-02-15 22:07:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:07:02,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 22:07:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:02,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 22:07:02,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:07:02,861 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:07:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:03,691 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2023-02-15 22:07:03,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 22:07:03,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2023-02-15 22:07:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:03,692 INFO L225 Difference]: With dead ends: 80 [2023-02-15 22:07:03,692 INFO L226 Difference]: Without dead ends: 80 [2023-02-15 22:07:03,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:07:03,695 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 63 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:03,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 243 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:07:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-02-15 22:07:03,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-02-15 22:07:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 66 states have internal predecessors, (68), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 22:07:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2023-02-15 22:07:03,712 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 48 [2023-02-15 22:07:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:03,712 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2023-02-15 22:07:03,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 22:07:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2023-02-15 22:07:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:07:03,713 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:03,713 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 22:07:03,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:03,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:03,924 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:07:03,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash 491835012, now seen corresponding path program 1 times [2023-02-15 22:07:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:03,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265446378] [2023-02-15 22:07:03,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:03,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:03,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:03,926 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:03,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-15 22:07:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:04,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 60 conjunts are in the unsatisfiable core [2023-02-15 22:07:04,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:04,218 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:07:04,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 22:07:04,233 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:04,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:07:04,292 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:07:04,526 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:04,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:07:04,627 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:07:04,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 22:07:04,631 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:04,831 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-02-15 22:07:04,895 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 15 [2023-02-15 22:07:05,032 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:07:05,032 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 14 [2023-02-15 22:07:05,730 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:07:05,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:06,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:07:06,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265446378] [2023-02-15 22:07:06,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265446378] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:06,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1302104000] [2023-02-15 22:07:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:06,950 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:07:06,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:07:06,952 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:07:06,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-02-15 22:07:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:07:07,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 22:07:07,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:07:07,297 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:07:07,447 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:07:07,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:07:07,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 22:07:07,640 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-15 22:07:08,079 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:08,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:07:08,215 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:08,228 INFO L350 Elim1Store]: Elim1 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 [2023-02-15 22:07:08,267 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:07:08,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 26 [2023-02-15 22:07:08,607 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 35 [2023-02-15 22:07:08,729 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 18 [2023-02-15 22:07:09,214 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:07:09,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2023-02-15 22:07:09,468 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:07:09,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2023-02-15 22:07:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:07:09,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:07:12,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1302104000] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:07:12,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:07:12,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 45 [2023-02-15 22:07:12,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631250600] [2023-02-15 22:07:12,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:07:12,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 22:07:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:07:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 22:07:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2991, Unknown=0, NotChecked=0, Total=3192 [2023-02-15 22:07:12,508 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 46 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 40 states have internal predecessors, (71), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:07:16,617 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2023-02-15 22:07:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:07:16,617 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 40 states have internal predecessors, (71), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 49 [2023-02-15 22:07:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:07:16,618 INFO L225 Difference]: With dead ends: 56 [2023-02-15 22:07:16,618 INFO L226 Difference]: Without dead ends: 53 [2023-02-15 22:07:16,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1388 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=381, Invalid=5625, Unknown=0, NotChecked=0, Total=6006 [2023-02-15 22:07:16,619 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 59 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:07:16,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 358 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 22:07:16,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-02-15 22:07:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-02-15 22:07:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 22:07:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 52 transitions. [2023-02-15 22:07:16,621 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 52 transitions. Word has length 49 [2023-02-15 22:07:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:07:16,621 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 52 transitions. [2023-02-15 22:07:16,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 40 states have internal predecessors, (71), 9 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:07:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 52 transitions. [2023-02-15 22:07:16,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 22:07:16,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:07:16,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:16,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Forceful destruction successful, exit code 0 [2023-02-15 22:07:16,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-02-15 22:07:17,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:17,033 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 26 more)] === [2023-02-15 22:07:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:07:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash -945482383, now seen corresponding path program 1 times [2023-02-15 22:07:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:07:17,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42565693] [2023-02-15 22:07:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:07:17,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:17,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:07:17,035 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 22:07:17,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-15 22:07:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:07:17,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 22:07:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 22:07:17,411 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 22:07:17,415 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 22:07:17,415 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (28 of 29 remaining) [2023-02-15 22:07:17,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 29 remaining) [2023-02-15 22:07:17,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 29 remaining) [2023-02-15 22:07:17,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 29 remaining) [2023-02-15 22:07:17,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 29 remaining) [2023-02-15 22:07:17,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 29 remaining) [2023-02-15 22:07:17,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 29 remaining) [2023-02-15 22:07:17,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 29 remaining) [2023-02-15 22:07:17,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 29 remaining) [2023-02-15 22:07:17,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 29 remaining) [2023-02-15 22:07:17,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 29 remaining) [2023-02-15 22:07:17,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 29 remaining) [2023-02-15 22:07:17,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 29 remaining) [2023-02-15 22:07:17,430 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 29 remaining) [2023-02-15 22:07:17,431 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ldv_list_delErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 29 remaining) [2023-02-15 22:07:17,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location __ldv_list_addErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 29 remaining) [2023-02-15 22:07:17,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-02-15 22:07:17,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 22:07:17,645 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:07:17,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 22:07:17,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:07:17 BoogieIcfgContainer [2023-02-15 22:07:17,697 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 22:07:17,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 22:07:17,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 22:07:17,698 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 22:07:17,698 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:05:33" (3/4) ... [2023-02-15 22:07:17,700 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-15 22:07:17,700 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 22:07:17,701 INFO L158 Benchmark]: Toolchain (without parser) took 105274.65ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 84.6MB in the beginning and 63.8MB in the end (delta: 20.8MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2023-02-15 22:07:17,701 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 73.4MB. Free memory was 50.9MB in the beginning and 50.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:07:17,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.63ms. Allocated memory is still 109.1MB. Free memory was 84.3MB in the beginning and 82.9MB in the end (delta: 1.4MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2023-02-15 22:07:17,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.89ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 80.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 22:07:17,701 INFO L158 Benchmark]: Boogie Preprocessor took 51.63ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 22:07:17,705 INFO L158 Benchmark]: RCFGBuilder took 473.36ms. Allocated memory is still 109.1MB. Free memory was 78.7MB in the beginning and 56.4MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-02-15 22:07:17,705 INFO L158 Benchmark]: TraceAbstraction took 104162.02ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 56.0MB in the beginning and 64.9MB in the end (delta: -8.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2023-02-15 22:07:17,705 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 163.6MB. Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 22:07:17,706 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 73.4MB. Free memory was 50.9MB in the beginning and 50.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.63ms. Allocated memory is still 109.1MB. Free memory was 84.3MB in the beginning and 82.9MB in the end (delta: 1.4MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.89ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 80.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.63ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 78.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 473.36ms. Allocated memory is still 109.1MB. Free memory was 78.7MB in the beginning and 56.4MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 104162.02ms. Allocated memory was 109.1MB in the beginning and 163.6MB in the end (delta: 54.5MB). Free memory was 56.0MB in the beginning and 64.9MB in the end (delta: -8.9MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 163.6MB. Free memory was 64.9MB in the beginning and 63.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 780]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 780. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L757] struct ldv_list_head global_list_13 = { &(global_list_13), &(global_list_13) }; VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L781] CALL entry_point() [L776] CALL alloc_13() [L763] CALL, EXPR ldv_malloc(sizeof(struct A13)) VAL [\old(size)=12, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L763] RET, EXPR ldv_malloc(sizeof(struct A13)) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, ldv_malloc(sizeof(struct A13))={6:0}] [L763] struct A13 *p = (struct A13 *)ldv_malloc(sizeof(struct A13)); [L764] COND TRUE \read(*p) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L765] CALL ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={2:0}, head={2:0}, ldv_global_msg_list={1:0}, new={6:4}] [L559] EXPR head->next VAL [global_list_13={2:0}, head={2:0}, head={2:0}, head->next={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}] [L559] CALL __ldv_list_add(new, head, head->next) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, next={2:0}, prev={2:0}] [L547] next->prev = new VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L548] new->next = next VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L549] new->prev = prev VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L550] prev->next = new VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L559] RET __ldv_list_add(new, head, head->next) VAL [global_list_13={2:0}, head={2:0}, head={2:0}, head->next={2:0}, ldv_global_msg_list={1:0}, new={6:4}, new={6:4}] [L765] RET ldv_list_add(&p->list, &global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L776] RET alloc_13() [L777] CALL free_unsafe_13() [L769] struct A13 *p; [L770] struct A13 *n; VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L771] EXPR (&global_list_13)->next VAL [(&global_list_13)->next={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L771] const typeof( ((typeof(*p) *)0)->list ) *__mptr = ((&global_list_13)->next); [L771] p = ({ const typeof( ((typeof(*p) *)0)->list ) *__mptr = ((&global_list_13)->next); (typeof(*p) *)( (char *)__mptr - ((size_t) &((typeof(*p) *)0)->list) );}) VAL [__mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L771] EXPR (p)->list.next VAL [(p)->list.next={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L771] const typeof( ((typeof(*(p)) *)0)->list ) *__mptr = ((p)->list.next); [L771] n = ({ const typeof( ((typeof(*(p)) *)0)->list ) *__mptr = ((p)->list.next); (typeof(*(p)) *)( (char *)__mptr - ((size_t) &((typeof(*(p)) *)0)->list) );}) VAL [__mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={6:0}] [L771] COND TRUE &p->list != (&global_list_13) VAL [__mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={6:0}] [L772] CALL ldv_list_del(&p->list) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L567] EXPR entry->prev VAL [entry={6:4}, entry={6:4}, entry->prev={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L567] EXPR entry->next VAL [entry={6:4}, entry={6:4}, entry->next={2:0}, entry->prev={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}] [L567] CALL __ldv_list_del(entry->prev, entry->next) [L554] next->prev = prev VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L555] prev->next = next VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, next={2:0}, next={2:0}, prev={2:0}, prev={2:0}] [L567] RET __ldv_list_del(entry->prev, entry->next) [L772] RET ldv_list_del(&p->list) VAL [__mptr={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={6:0}] [L771] p = n VAL [__mptr={2:0}, __mptr={6:4}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L771] EXPR (n)->list.next VAL [(n)->list.next={2:0}, __mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L771] const typeof( ((typeof(*(n)) *)0)->list ) *__mptr = ((n)->list.next); [L771] n = ({ const typeof( ((typeof(*(n)) *)0)->list ) *__mptr = ((n)->list.next); (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) );}) VAL [__mptr={6:4}, __mptr={2:0}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L771] COND FALSE !(&p->list != (&global_list_13)) VAL [__mptr={2:0}, __mptr={6:4}, __mptr={2:0}, global_list_13={2:0}, ldv_global_msg_list={1:0}, n={2:-4}, p={2:-4}] [L777] RET free_unsafe_13() [L778] CALL LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}] [L540] list->next = list VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}, list={2:0}] [L541] list->prev = list VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}, list={2:0}, list={2:0}] [L778] RET LDV_INIT_LIST_HEAD(&global_list_13) VAL [global_list_13={2:0}, ldv_global_msg_list={1:0}] [L781] RET entry_point() - 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: -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: -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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 82 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 104.1s, OverallIterations: 32, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 61.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 52 mSolverCounterUnknown, 2496 SdHoareTripleChecker+Valid, 29.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2449 mSDsluCounter, 8134 SdHoareTripleChecker+Invalid, 27.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6821 mSDsCounter, 381 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12308 IncrementalHoareTripleChecker+Invalid, 12741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 381 mSolverCounterUnsat, 1313 mSDtfsCounter, 12308 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1232 GetRequests, 617 SyntacticMatches, 6 SemanticMatches, 609 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=8, InterpolantAutomatonStates: 427, 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, 31 MinimizatonAttempts, 276 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 32.3s InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 957 ConstructedInterpolants, 100 QuantifiedInterpolants, 14512 SizeOfPredicates, 384 NumberOfNonLiveVariables, 4833 ConjunctsInSsa, 840 ConjunctsInUnsatCore, 34 InterpolantComputations, 28 PerfectInterpolantSequences, 7/32 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 could not prove your program: unable to determine feasibility of some traces [2023-02-15 22:07:17,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample