./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-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 --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 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:01:30,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:01:30,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:01:30,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:01:30,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:01:30,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:01:30,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:01:30,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:01:30,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:01:30,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:01:30,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:01:30,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:01:30,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:01:30,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:01:30,145 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:01:30,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:01:30,147 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:01:30,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:01:30,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:01:30,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:01:30,152 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:01:30,153 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:01:30,154 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:01:30,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:01:30,154 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:01:30,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:01:30,155 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:01:30,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:01:30,155 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:01:30,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:01:30,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:01:30,156 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:01:30,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:01:30,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:01:30,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:01:30,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:01:30,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:01:30,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:01:30,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:01:30,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:01:30,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:01:30,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:01:30,161 INFO L153 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 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2024-10-13 12:01:30,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:01:30,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:01:30,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:01:30,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:01:30,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:01:30,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-13 12:01:31,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:01:32,200 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:01:32,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-13 12:01:32,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e6db5e8/0ee884b1c45742819c77d8c9fa696d1e/FLAGd022eaedf [2024-10-13 12:01:32,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e6db5e8/0ee884b1c45742819c77d8c9fa696d1e [2024-10-13 12:01:32,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:01:32,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:01:32,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:32,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:01:32,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:01:32,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:32" (1/1) ... [2024-10-13 12:01:32,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b227f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:32, skipping insertion in model container [2024-10-13 12:01:32,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:32" (1/1) ... [2024-10-13 12:01:32,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:01:32,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:32,894 ERROR L321 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) [2024-10-13 12:01:32,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@59350a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:32, skipping insertion in model container [2024-10-13 12:01:32,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:32,896 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:01:32,898 INFO L158 Benchmark]: Toolchain (without parser) took 651.31ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 92.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 12:01:32,898 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:01:32,899 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.26ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 92.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 12:01:32,901 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 649.26ms. Allocated memory is still 146.8MB. Free memory was 114.1MB in the beginning and 92.1MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-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 --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 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:01:34,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:01:35,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:01:35,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:01:35,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:01:35,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:01:35,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:01:35,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:01:35,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:01:35,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:01:35,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:01:35,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:01:35,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:01:35,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:01:35,075 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:01:35,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:01:35,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:01:35,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:01:35,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:01:35,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:01:35,077 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:01:35,081 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:01:35,081 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:01:35,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:01:35,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:01:35,082 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:01:35,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:01:35,083 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:01:35,083 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:01:35,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:01:35,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:01:35,084 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:01:35,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:01:35,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:01:35,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:01:35,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:01:35,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:01:35,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:01:35,088 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:01:35,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:01:35,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:01:35,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:01:35,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:01:35,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:01:35,089 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:01:35,089 INFO L153 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 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 -> 42d34b3801344b79b388ecea52b2e670196aa6b758fe24ea6ecf5c2b8bbf579b [2024-10-13 12:01:35,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:01:35,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:01:35,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:01:35,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:01:35,477 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:01:35,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-13 12:01:37,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:01:37,480 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:01:37,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test8-2.i [2024-10-13 12:01:37,499 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bfd54611/bc7bf4a8aa54420d9ff2c767a664ade1/FLAGf3a3ef33f [2024-10-13 12:01:37,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bfd54611/bc7bf4a8aa54420d9ff2c767a664ade1 [2024-10-13 12:01:37,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:01:37,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:01:37,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:37,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:01:37,523 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:01:37,524 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:37" (1/1) ... [2024-10-13 12:01:37,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@430d55bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:37, skipping insertion in model container [2024-10-13 12:01:37,525 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:01:37" (1/1) ... [2024-10-13 12:01:37,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:01:38,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:38,210 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:01:38,234 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:01:38,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:38,338 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:01:38,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:01:38,475 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:01:38,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38 WrapperNode [2024-10-13 12:01:38,476 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:01:38,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:01:38,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:01:38,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:01:38,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,625 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-10-13 12:01:38,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:01:38,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:01:38,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:01:38,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:01:38,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,759 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-13 12:01:38,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:01:38,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:01:38,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:01:38,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:01:38,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (1/1) ... [2024-10-13 12:01:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:01:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:01:38,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:01:38,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:01:39,004 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 12:01:39,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 12:01:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 12:01:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 12:01:39,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 12:01:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:01:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:01:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:01:39,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:01:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:01:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 12:01:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 12:01:39,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 12:01:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 12:01:39,008 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 12:01:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 12:01:39,009 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-13 12:01:39,009 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:01:39,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:01:39,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:01:39,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:01:39,262 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:01:39,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:01:39,289 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:01:39,334 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:01:39,360 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:01:43,358 INFO L? ?]: Removed 1322 outVars from TransFormulas that were not future-live. [2024-10-13 12:01:43,358 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:01:43,534 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:01:43,534 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-13 12:01:43,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:01:43 BoogieIcfgContainer [2024-10-13 12:01:43,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:01:43,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:01:43,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:01:43,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:01:43,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:01:37" (1/3) ... [2024-10-13 12:01:43,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e573a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:01:43, skipping insertion in model container [2024-10-13 12:01:43,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:01:38" (2/3) ... [2024-10-13 12:01:43,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e573a2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:01:43, skipping insertion in model container [2024-10-13 12:01:43,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:01:43" (3/3) ... [2024-10-13 12:01:43,549 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test8-2.i [2024-10-13 12:01:43,565 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:01:43,565 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2024-10-13 12:01:43,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:01:43,646 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@2219ec21, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:01:43,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2024-10-13 12:01:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 1181 states, 523 states have (on average 2.5066921606118546) internal successors, (1311), 1171 states have internal predecessors, (1311), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 12:01:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 12:01:43,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:43,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 12:01:43,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:43,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 70318, now seen corresponding path program 1 times [2024-10-13 12:01:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:43,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796622065] [2024-10-13 12:01:43,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:43,674 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 [2024-10-13 12:01:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:43,675 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) [2024-10-13 12:01:43,677 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 [2024-10-13 12:01:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:43,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:01:43,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:43,884 INFO L378 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 [2024-10-13 12:01:43,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:43,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:43,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:43,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796622065] [2024-10-13 12:01:43,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796622065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:43,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:43,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:01:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311836113] [2024-10-13 12:01:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:43,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:01:43,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:43,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:01:43,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:43,932 INFO L87 Difference]: Start difference. First operand has 1181 states, 523 states have (on average 2.5066921606118546) internal successors, (1311), 1171 states have internal predecessors, (1311), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:45,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:45,750 INFO L93 Difference]: Finished difference Result 1348 states and 1455 transitions. [2024-10-13 12:01:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:01:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 12:01:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:45,773 INFO L225 Difference]: With dead ends: 1348 [2024-10-13 12:01:45,773 INFO L226 Difference]: Without dead ends: 1347 [2024-10-13 12:01:45,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:45,782 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 1048 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:45,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 901 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 12:01:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-13 12:01:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1171. [2024-10-13 12:01:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 529 states have (on average 2.3232514177693764) internal successors, (1229), 1160 states have internal predecessors, (1229), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 12:01:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1273 transitions. [2024-10-13 12:01:45,875 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1273 transitions. Word has length 2 [2024-10-13 12:01:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1273 transitions. [2024-10-13 12:01:45,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:45,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1273 transitions. [2024-10-13 12:01:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 12:01:45,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:45,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 12:01:45,881 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 (2)] Ended with exit code 0 [2024-10-13 12:01:46,080 WARN L453 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 [2024-10-13 12:01:46,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:46,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:46,081 INFO L85 PathProgramCache]: Analyzing trace with hash 70319, now seen corresponding path program 1 times [2024-10-13 12:01:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028595617] [2024-10-13 12:01:46,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:46,081 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 [2024-10-13 12:01:46,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:46,083 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) [2024-10-13 12:01:46,104 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 [2024-10-13 12:01:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:46,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:01:46,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:46,240 INFO L378 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 [2024-10-13 12:01:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:46,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:46,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:46,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028595617] [2024-10-13 12:01:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028595617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:46,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:01:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889141221] [2024-10-13 12:01:46,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:01:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:46,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:01:46,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:46,257 INFO L87 Difference]: Start difference. First operand 1171 states and 1273 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:48,743 INFO L93 Difference]: Finished difference Result 1720 states and 1865 transitions. [2024-10-13 12:01:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:01:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 12:01:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:48,754 INFO L225 Difference]: With dead ends: 1720 [2024-10-13 12:01:48,754 INFO L226 Difference]: Without dead ends: 1720 [2024-10-13 12:01:48,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:48,756 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 588 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:48,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1540 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 12:01:48,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-13 12:01:48,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1348. [2024-10-13 12:01:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 706 states have (on average 2.2988668555240794) internal successors, (1623), 1336 states have internal predecessors, (1623), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 12:01:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1669 transitions. [2024-10-13 12:01:48,799 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1669 transitions. Word has length 2 [2024-10-13 12:01:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1669 transitions. [2024-10-13 12:01:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1669 transitions. [2024-10-13 12:01:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:01:48,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:48,801 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:01:48,820 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 [2024-10-13 12:01:49,018 WARN L453 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 [2024-10-13 12:01:49,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:49,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:49,019 INFO L85 PathProgramCache]: Analyzing trace with hash 519002808, now seen corresponding path program 1 times [2024-10-13 12:01:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759458073] [2024-10-13 12:01:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:49,020 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 [2024-10-13 12:01:49,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:49,024 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) [2024-10-13 12:01:49,026 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 [2024-10-13 12:01:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:49,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:01:49,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:49,184 INFO L378 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 [2024-10-13 12:01:49,190 INFO L378 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 [2024-10-13 12:01:49,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:01:49,250 INFO L378 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 14 treesize of output 9 [2024-10-13 12:01:49,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:01:49,269 INFO L378 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 [2024-10-13 12:01:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:49,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:49,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:49,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759458073] [2024-10-13 12:01:49,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1759458073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:49,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:49,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:01:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172709869] [2024-10-13 12:01:49,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:49,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:01:49,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:49,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:01:49,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:01:49,298 INFO L87 Difference]: Start difference. First operand 1348 states and 1669 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:51,760 INFO L93 Difference]: Finished difference Result 1518 states and 1846 transitions. [2024-10-13 12:01:51,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:01:51,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 12:01:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:51,766 INFO L225 Difference]: With dead ends: 1518 [2024-10-13 12:01:51,767 INFO L226 Difference]: Without dead ends: 1518 [2024-10-13 12:01:51,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:01:51,768 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 1340 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:51,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 583 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-13 12:01:51,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-10-13 12:01:51,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1159. [2024-10-13 12:01:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 529 states have (on average 2.298676748582231) internal successors, (1216), 1148 states have internal predecessors, (1216), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 12:01:51,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1260 transitions. [2024-10-13 12:01:51,797 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1260 transitions. Word has length 6 [2024-10-13 12:01:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:51,797 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1260 transitions. [2024-10-13 12:01:51,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1260 transitions. [2024-10-13 12:01:51,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:01:51,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:51,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:01:51,803 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 (4)] Ended with exit code 0 [2024-10-13 12:01:51,999 WARN L453 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 [2024-10-13 12:01:51,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:52,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1090782041, now seen corresponding path program 1 times [2024-10-13 12:01:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:52,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165982492] [2024-10-13 12:01:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:52,001 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 [2024-10-13 12:01:52,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:52,004 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) [2024-10-13 12:01:52,005 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 [2024-10-13 12:01:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:52,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:01:52,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:52,148 INFO L378 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 [2024-10-13 12:01:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:52,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:52,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:52,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165982492] [2024-10-13 12:01:52,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165982492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:52,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:52,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:01:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757560575] [2024-10-13 12:01:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:01:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:52,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:01:52,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:52,168 INFO L87 Difference]: Start difference. First operand 1159 states and 1260 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:54,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:54,058 INFO L93 Difference]: Finished difference Result 1459 states and 1589 transitions. [2024-10-13 12:01:54,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:01:54,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:01:54,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:54,064 INFO L225 Difference]: With dead ends: 1459 [2024-10-13 12:01:54,064 INFO L226 Difference]: Without dead ends: 1459 [2024-10-13 12:01:54,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:54,065 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 842 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:54,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1372 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 12:01:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-13 12:01:54,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1111. [2024-10-13 12:01:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 529 states have (on average 2.2060491493383743) internal successors, (1167), 1100 states have internal predecessors, (1167), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 12:01:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1211 transitions. [2024-10-13 12:01:54,087 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1211 transitions. Word has length 7 [2024-10-13 12:01:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:54,087 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1211 transitions. [2024-10-13 12:01:54,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1211 transitions. [2024-10-13 12:01:54,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:01:54,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:54,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:01:54,095 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 (5)] Ended with exit code 0 [2024-10-13 12:01:54,291 WARN L453 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 [2024-10-13 12:01:54,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1090782040, now seen corresponding path program 1 times [2024-10-13 12:01:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:54,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263939669] [2024-10-13 12:01:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:54,293 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 [2024-10-13 12:01:54,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:54,294 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) [2024-10-13 12:01:54,295 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 [2024-10-13 12:01:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:54,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:01:54,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:54,456 INFO L378 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 [2024-10-13 12:01:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:54,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:54,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263939669] [2024-10-13 12:01:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263939669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:01:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780849603] [2024-10-13 12:01:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:54,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:01:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:01:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:54,484 INFO L87 Difference]: Start difference. First operand 1111 states and 1211 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:56,517 INFO L93 Difference]: Finished difference Result 1546 states and 1682 transitions. [2024-10-13 12:01:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:01:56,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:01:56,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:56,522 INFO L225 Difference]: With dead ends: 1546 [2024-10-13 12:01:56,522 INFO L226 Difference]: Without dead ends: 1546 [2024-10-13 12:01:56,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:56,523 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 633 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:56,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1686 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 12:01:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-10-13 12:01:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1319. [2024-10-13 12:01:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 745 states have (on average 2.1865771812080537) internal successors, (1629), 1306 states have internal predecessors, (1629), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 12:01:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1677 transitions. [2024-10-13 12:01:56,580 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1677 transitions. Word has length 7 [2024-10-13 12:01:56,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:56,580 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1677 transitions. [2024-10-13 12:01:56,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1677 transitions. [2024-10-13 12:01:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:01:56,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:56,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:01:56,586 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 (6)] Ended with exit code 0 [2024-10-13 12:01:56,782 WARN L453 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 [2024-10-13 12:01:56,782 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:56,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -709812944, now seen corresponding path program 1 times [2024-10-13 12:01:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674556049] [2024-10-13 12:01:56,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:56,784 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 [2024-10-13 12:01:56,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:56,785 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) [2024-10-13 12:01:56,786 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 [2024-10-13 12:01:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:56,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:01:56,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:56,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:56,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674556049] [2024-10-13 12:01:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674556049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:01:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860131330] [2024-10-13 12:01:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:56,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:01:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:56,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:01:56,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:56,975 INFO L87 Difference]: Start difference. First operand 1319 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:57,871 INFO L93 Difference]: Finished difference Result 1998 states and 2612 transitions. [2024-10-13 12:01:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:01:57,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 12:01:57,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:57,878 INFO L225 Difference]: With dead ends: 1998 [2024-10-13 12:01:57,878 INFO L226 Difference]: Without dead ends: 1998 [2024-10-13 12:01:57,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:57,879 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 572 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:57,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 2122 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:01:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2024-10-13 12:01:57,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1654. [2024-10-13 12:01:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1078 states have (on average 2.170686456400742) internal successors, (2340), 1639 states have internal predecessors, (2340), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:01:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2392 transitions. [2024-10-13 12:01:57,913 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2392 transitions. Word has length 10 [2024-10-13 12:01:57,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:57,914 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2392 transitions. [2024-10-13 12:01:57,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2392 transitions. [2024-10-13 12:01:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 12:01:57,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:57,915 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:01:57,919 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 (7)] Ended with exit code 0 [2024-10-13 12:01:58,115 WARN L453 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 [2024-10-13 12:01:58,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 170345729, now seen corresponding path program 1 times [2024-10-13 12:01:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:58,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268265964] [2024-10-13 12:01:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:58,117 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 [2024-10-13 12:01:58,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:58,118 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) [2024-10-13 12:01:58,119 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 [2024-10-13 12:01:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:58,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:01:58,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:58,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:58,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268265964] [2024-10-13 12:01:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268265964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:58,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:58,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:01:58,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493588065] [2024-10-13 12:01:58,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:58,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:01:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:01:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:58,256 INFO L87 Difference]: Start difference. First operand 1654 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:58,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:01:58,822 INFO L93 Difference]: Finished difference Result 1570 states and 2232 transitions. [2024-10-13 12:01:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:01:58,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 12:01:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:01:58,828 INFO L225 Difference]: With dead ends: 1570 [2024-10-13 12:01:58,828 INFO L226 Difference]: Without dead ends: 1570 [2024-10-13 12:01:58,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:01:58,829 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 61 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:01:58,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1994 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 12:01:58,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-13 12:01:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-10-13 12:01:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1018 states have (on average 2.1414538310412574) internal successors, (2180), 1555 states have internal predecessors, (2180), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:01:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2232 transitions. [2024-10-13 12:01:58,861 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2232 transitions. Word has length 12 [2024-10-13 12:01:58,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:01:58,861 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2232 transitions. [2024-10-13 12:01:58,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:01:58,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2232 transitions. [2024-10-13 12:01:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 12:01:58,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:01:58,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:01:58,867 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 (8)] Ended with exit code 0 [2024-10-13 12:01:59,063 WARN L453 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 [2024-10-13 12:01:59,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr632ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:01:59,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:01:59,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1905928002, now seen corresponding path program 1 times [2024-10-13 12:01:59,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:01:59,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796769448] [2024-10-13 12:01:59,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:01:59,065 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 [2024-10-13 12:01:59,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:01:59,068 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) [2024-10-13 12:01:59,069 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 [2024-10-13 12:01:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:01:59,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:01:59,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:01:59,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:01:59,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:01:59,229 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:01:59,233 INFO L378 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 30 treesize of output 39 [2024-10-13 12:01:59,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:01:59,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 12:01:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:01:59,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:01:59,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:01:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796769448] [2024-10-13 12:01:59,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796769448] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:01:59,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:01:59,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:01:59,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299586977] [2024-10-13 12:01:59,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:01:59,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:01:59,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:01:59,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:01:59,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:01:59,293 INFO L87 Difference]: Start difference. First operand 1570 states and 2232 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:00,335 INFO L93 Difference]: Finished difference Result 2774 states and 3844 transitions. [2024-10-13 12:02:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 12:02:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:00,345 INFO L225 Difference]: With dead ends: 2774 [2024-10-13 12:02:00,345 INFO L226 Difference]: Without dead ends: 2774 [2024-10-13 12:02:00,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:00,346 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1017 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:00,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3043 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:02:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2024-10-13 12:02:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1569. [2024-10-13 12:02:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1017 states have (on average 2.1415929203539825) internal successors, (2178), 1554 states have internal predecessors, (2178), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:02:00,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2230 transitions. [2024-10-13 12:02:00,378 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2230 transitions. Word has length 13 [2024-10-13 12:02:00,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:00,378 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2230 transitions. [2024-10-13 12:02:00,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:00,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2230 transitions. [2024-10-13 12:02:00,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 12:02:00,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:00,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:00,385 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 (9)] Ended with exit code 0 [2024-10-13 12:02:00,580 WARN L453 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 [2024-10-13 12:02:00,580 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash -249532353, now seen corresponding path program 1 times [2024-10-13 12:02:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:00,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301014680] [2024-10-13 12:02:00,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:00,581 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 [2024-10-13 12:02:00,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:00,583 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) [2024-10-13 12:02:00,584 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 [2024-10-13 12:02:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:00,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:02:00,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:00,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:00,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301014680] [2024-10-13 12:02:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301014680] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:00,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530072942] [2024-10-13 12:02:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:02:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:00,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:02:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:00,765 INFO L87 Difference]: Start difference. First operand 1569 states and 2230 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:01,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:01,369 INFO L93 Difference]: Finished difference Result 1515 states and 2150 transitions. [2024-10-13 12:02:01,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:02:01,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-13 12:02:01,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:01,375 INFO L225 Difference]: With dead ends: 1515 [2024-10-13 12:02:01,375 INFO L226 Difference]: Without dead ends: 1515 [2024-10-13 12:02:01,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:02:01,376 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 61 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:01,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1920 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 12:02:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-10-13 12:02:01,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2024-10-13 12:02:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 987 states have (on average 2.125633232016211) internal successors, (2098), 1500 states have internal predecessors, (2098), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:02:01,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2150 transitions. [2024-10-13 12:02:01,400 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2150 transitions. Word has length 15 [2024-10-13 12:02:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2150 transitions. [2024-10-13 12:02:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2150 transitions. [2024-10-13 12:02:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 12:02:01,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:01,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:01,407 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 (10)] Ended with exit code 0 [2024-10-13 12:02:01,602 WARN L453 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 [2024-10-13 12:02:01,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:01,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash 717576632, now seen corresponding path program 1 times [2024-10-13 12:02:01,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:01,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629563208] [2024-10-13 12:02:01,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:01,603 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 [2024-10-13 12:02:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:01,606 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) [2024-10-13 12:02:01,607 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 [2024-10-13 12:02:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:01,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:01,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:01,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:01,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:01,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629563208] [2024-10-13 12:02:01,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629563208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:01,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:01,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:01,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932243409] [2024-10-13 12:02:01,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:01,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:01,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:01,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:01,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:01,795 INFO L87 Difference]: Start difference. First operand 1515 states and 2150 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:02,752 INFO L93 Difference]: Finished difference Result 1499 states and 2106 transitions. [2024-10-13 12:02:02,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:02:02,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 12:02:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:02,757 INFO L225 Difference]: With dead ends: 1499 [2024-10-13 12:02:02,757 INFO L226 Difference]: Without dead ends: 1499 [2024-10-13 12:02:02,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:02,757 INFO L432 NwaCegarLoop]: 950 mSDtfsCounter, 45 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:02,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2832 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:02:02,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-10-13 12:02:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-10-13 12:02:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 985 states have (on average 2.085279187817259) internal successors, (2054), 1484 states have internal predecessors, (2054), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:02:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2106 transitions. [2024-10-13 12:02:02,779 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2106 transitions. Word has length 17 [2024-10-13 12:02:02,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:02,779 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 2106 transitions. [2024-10-13 12:02:02,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2106 transitions. [2024-10-13 12:02:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 12:02:02,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:02,780 INFO L215 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] [2024-10-13 12:02:02,786 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 (11)] Ended with exit code 0 [2024-10-13 12:02:02,984 WARN L453 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 [2024-10-13 12:02:02,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2015839738, now seen corresponding path program 1 times [2024-10-13 12:02:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756500188] [2024-10-13 12:02:02,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:02,987 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 [2024-10-13 12:02:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:02,990 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) [2024-10-13 12:02:02,991 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 [2024-10-13 12:02:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:03,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:03,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:03,154 INFO L378 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 [2024-10-13 12:02:03,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:03,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:03,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756500188] [2024-10-13 12:02:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756500188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:03,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:03,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370452590] [2024-10-13 12:02:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:03,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:03,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:03,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:03,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:03,216 INFO L87 Difference]: Start difference. First operand 1499 states and 2106 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:04,630 INFO L93 Difference]: Finished difference Result 1516 states and 2122 transitions. [2024-10-13 12:02:04,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:04,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 12:02:04,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:04,635 INFO L225 Difference]: With dead ends: 1516 [2024-10-13 12:02:04,635 INFO L226 Difference]: Without dead ends: 1516 [2024-10-13 12:02:04,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:04,636 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 744 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:04,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1292 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 12:02:04,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-10-13 12:02:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1495. [2024-10-13 12:02:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 985 states have (on average 2.0771573604060913) internal successors, (2046), 1480 states have internal predecessors, (2046), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:02:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2098 transitions. [2024-10-13 12:02:04,658 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2098 transitions. Word has length 31 [2024-10-13 12:02:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:04,659 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2098 transitions. [2024-10-13 12:02:04,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2098 transitions. [2024-10-13 12:02:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 12:02:04,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:04,660 INFO L215 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] [2024-10-13 12:02:04,666 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 (12)] Ended with exit code 0 [2024-10-13 12:02:04,860 WARN L453 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 [2024-10-13 12:02:04,860 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2015839737, now seen corresponding path program 1 times [2024-10-13 12:02:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871722503] [2024-10-13 12:02:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:04,862 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 [2024-10-13 12:02:04,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:04,864 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) [2024-10-13 12:02:04,865 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 [2024-10-13 12:02:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:05,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:02:05,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:05,060 INFO L378 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 [2024-10-13 12:02:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:05,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:05,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:05,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871722503] [2024-10-13 12:02:05,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871722503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:05,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:05,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:05,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985084419] [2024-10-13 12:02:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:05,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:05,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:05,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:05,238 INFO L87 Difference]: Start difference. First operand 1495 states and 2098 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:07,517 INFO L93 Difference]: Finished difference Result 1703 states and 2104 transitions. [2024-10-13 12:02:07,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-13 12:02:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:07,522 INFO L225 Difference]: With dead ends: 1703 [2024-10-13 12:02:07,522 INFO L226 Difference]: Without dead ends: 1703 [2024-10-13 12:02:07,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:07,523 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 531 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:07,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2401 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-13 12:02:07,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-10-13 12:02:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1491. [2024-10-13 12:02:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 985 states have (on average 2.0690355329949237) internal successors, (2038), 1476 states have internal predecessors, (2038), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:02:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2090 transitions. [2024-10-13 12:02:07,545 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2090 transitions. Word has length 31 [2024-10-13 12:02:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:07,546 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 2090 transitions. [2024-10-13 12:02:07,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2090 transitions. [2024-10-13 12:02:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 12:02:07,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:07,548 INFO L215 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] [2024-10-13 12:02:07,554 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 (13)] Ended with exit code 0 [2024-10-13 12:02:07,751 WARN L453 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 [2024-10-13 12:02:07,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:07,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1732169696, now seen corresponding path program 1 times [2024-10-13 12:02:07,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:07,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433705449] [2024-10-13 12:02:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:07,754 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 [2024-10-13 12:02:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:07,757 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) [2024-10-13 12:02:07,758 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 [2024-10-13 12:02:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:08,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:08,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:08,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:08,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433705449] [2024-10-13 12:02:08,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433705449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:08,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:08,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:08,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612887154] [2024-10-13 12:02:08,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:08,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:08,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:08,067 INFO L87 Difference]: Start difference. First operand 1491 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:08,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:08,721 INFO L93 Difference]: Finished difference Result 1479 states and 2070 transitions. [2024-10-13 12:02:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:02:08,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-13 12:02:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:08,726 INFO L225 Difference]: With dead ends: 1479 [2024-10-13 12:02:08,726 INFO L226 Difference]: Without dead ends: 1479 [2024-10-13 12:02:08,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:08,727 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 15 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:08,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2815 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 12:02:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-10-13 12:02:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1479. [2024-10-13 12:02:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 973 states have (on average 2.0739979445015417) internal successors, (2018), 1464 states have internal predecessors, (2018), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:02:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2070 transitions. [2024-10-13 12:02:08,746 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2070 transitions. Word has length 50 [2024-10-13 12:02:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:08,747 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2070 transitions. [2024-10-13 12:02:08,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2070 transitions. [2024-10-13 12:02:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 12:02:08,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:08,751 INFO L215 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, 1, 1] [2024-10-13 12:02:08,760 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 (14)] Ended with exit code 0 [2024-10-13 12:02:08,951 WARN L453 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 [2024-10-13 12:02:08,952 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:08,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:08,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1191760002, now seen corresponding path program 1 times [2024-10-13 12:02:08,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:08,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382412747] [2024-10-13 12:02:08,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:08,954 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 [2024-10-13 12:02:08,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:08,957 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) [2024-10-13 12:02:08,959 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 [2024-10-13 12:02:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:09,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:02:09,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:09,285 INFO L378 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 [2024-10-13 12:02:09,290 INFO L378 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 [2024-10-13 12:02:09,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:02:09,715 INFO L378 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 14 treesize of output 9 [2024-10-13 12:02:09,728 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:02:09,728 INFO L378 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 [2024-10-13 12:02:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:09,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:09,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:09,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382412747] [2024-10-13 12:02:09,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382412747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:09,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:09,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:02:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806845620] [2024-10-13 12:02:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:09,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:09,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:09,744 INFO L87 Difference]: Start difference. First operand 1479 states and 2070 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:11,320 INFO L93 Difference]: Finished difference Result 1452 states and 2044 transitions. [2024-10-13 12:02:11,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:11,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-13 12:02:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:11,325 INFO L225 Difference]: With dead ends: 1452 [2024-10-13 12:02:11,325 INFO L226 Difference]: Without dead ends: 1452 [2024-10-13 12:02:11,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:11,326 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 695 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:11,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 735 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 12:02:11,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-13 12:02:11,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1120. [2024-10-13 12:02:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 657 states have (on average 1.9710806697108068) internal successors, (1295), 1108 states have internal predecessors, (1295), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 12:02:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1341 transitions. [2024-10-13 12:02:11,346 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1341 transitions. Word has length 54 [2024-10-13 12:02:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:11,346 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1341 transitions. [2024-10-13 12:02:11,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1341 transitions. [2024-10-13 12:02:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 12:02:11,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:11,348 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:11,358 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 (15)] Ended with exit code 0 [2024-10-13 12:02:11,548 WARN L453 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 [2024-10-13 12:02:11,548 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:11,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:11,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1643354685, now seen corresponding path program 1 times [2024-10-13 12:02:11,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:11,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441823006] [2024-10-13 12:02:11,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:11,550 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 [2024-10-13 12:02:11,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:11,553 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) [2024-10-13 12:02:11,554 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 [2024-10-13 12:02:11,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:11,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:02:11,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:11,866 INFO L378 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 [2024-10-13 12:02:11,878 INFO L378 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 19 treesize of output 1 [2024-10-13 12:02:11,900 INFO L378 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 [2024-10-13 12:02:11,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:11,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:11,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:11,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441823006] [2024-10-13 12:02:11,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441823006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:11,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:11,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:11,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616538880] [2024-10-13 12:02:11,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:11,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:02:11,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:11,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:02:11,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:11,912 INFO L87 Difference]: Start difference. First operand 1120 states and 1341 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:13,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:13,707 INFO L93 Difference]: Finished difference Result 1119 states and 1340 transitions. [2024-10-13 12:02:13,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:02:13,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-13 12:02:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:13,713 INFO L225 Difference]: With dead ends: 1119 [2024-10-13 12:02:13,713 INFO L226 Difference]: Without dead ends: 1119 [2024-10-13 12:02:13,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:02:13,716 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:13,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2465 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-13 12:02:13,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-10-13 12:02:13,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2024-10-13 12:02:13,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 657 states have (on average 1.969558599695586) internal successors, (1294), 1107 states have internal predecessors, (1294), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 12:02:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1340 transitions. [2024-10-13 12:02:13,730 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1340 transitions. Word has length 58 [2024-10-13 12:02:13,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:13,730 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1340 transitions. [2024-10-13 12:02:13,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1340 transitions. [2024-10-13 12:02:13,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 12:02:13,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:13,732 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:13,740 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 (16)] Ended with exit code 0 [2024-10-13 12:02:13,935 WARN L453 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 [2024-10-13 12:02:13,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:13,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1643354686, now seen corresponding path program 1 times [2024-10-13 12:02:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031269204] [2024-10-13 12:02:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:13,937 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 [2024-10-13 12:02:13,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:13,938 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) [2024-10-13 12:02:13,939 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 [2024-10-13 12:02:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:14,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:02:14,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:14,243 INFO L378 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 [2024-10-13 12:02:14,263 INFO L378 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 19 treesize of output 1 [2024-10-13 12:02:14,268 INFO L378 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 [2024-10-13 12:02:14,308 INFO L378 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 21 treesize of output 9 [2024-10-13 12:02:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:14,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:14,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031269204] [2024-10-13 12:02:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031269204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:14,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:14,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263915491] [2024-10-13 12:02:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:14,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:02:14,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:02:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:02:14,328 INFO L87 Difference]: Start difference. First operand 1119 states and 1340 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:16,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:16,354 INFO L93 Difference]: Finished difference Result 1118 states and 1339 transitions. [2024-10-13 12:02:16,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:02:16,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-13 12:02:16,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:16,359 INFO L225 Difference]: With dead ends: 1118 [2024-10-13 12:02:16,359 INFO L226 Difference]: Without dead ends: 1118 [2024-10-13 12:02:16,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:02:16,360 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 1 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:16,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2519 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 12:02:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-10-13 12:02:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2024-10-13 12:02:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 656 states have (on average 1.9710365853658536) internal successors, (1293), 1106 states have internal predecessors, (1293), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 12:02:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1339 transitions. [2024-10-13 12:02:16,373 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1339 transitions. Word has length 58 [2024-10-13 12:02:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:16,373 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1339 transitions. [2024-10-13 12:02:16,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:02:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1339 transitions. [2024-10-13 12:02:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 12:02:16,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:16,375 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:16,384 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 [2024-10-13 12:02:16,576 WARN L453 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 [2024-10-13 12:02:16,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:16,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash 729926273, now seen corresponding path program 1 times [2024-10-13 12:02:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:16,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103492492] [2024-10-13 12:02:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:16,577 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 [2024-10-13 12:02:16,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:16,578 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) [2024-10-13 12:02:16,579 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 [2024-10-13 12:02:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:16,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:02:16,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:16,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:02:16,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:16,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103492492] [2024-10-13 12:02:16,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103492492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:02:16,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:02:16,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:02:16,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915898250] [2024-10-13 12:02:16,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:02:16,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:02:16,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:16,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:02:16,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:16,868 INFO L87 Difference]: Start difference. First operand 1118 states and 1339 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2024-10-13 12:02:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:17,444 INFO L93 Difference]: Finished difference Result 1120 states and 1342 transitions. [2024-10-13 12:02:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:02:17,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-13 12:02:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:17,449 INFO L225 Difference]: With dead ends: 1120 [2024-10-13 12:02:17,449 INFO L226 Difference]: Without dead ends: 1120 [2024-10-13 12:02:17,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:02:17,450 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 0 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:17,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2745 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 12:02:17,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-10-13 12:02:17,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2024-10-13 12:02:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 657 states have (on average 1.9710806697108068) internal successors, (1295), 1108 states have internal predecessors, (1295), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 12:02:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1342 transitions. [2024-10-13 12:02:17,474 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1342 transitions. Word has length 64 [2024-10-13 12:02:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1342 transitions. [2024-10-13 12:02:17,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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) [2024-10-13 12:02:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1342 transitions. [2024-10-13 12:02:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 12:02:17,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:17,476 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:17,487 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 [2024-10-13 12:02:17,676 WARN L453 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 [2024-10-13 12:02:17,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:17,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:17,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1279979101, now seen corresponding path program 1 times [2024-10-13 12:02:17,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:17,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902166840] [2024-10-13 12:02:17,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:02:17,678 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 [2024-10-13 12:02:17,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:17,681 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) [2024-10-13 12:02:17,682 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 [2024-10-13 12:02:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:02:17,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:02:17,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:17,981 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:18,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:18,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902166840] [2024-10-13 12:02:18,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902166840] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:18,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:18,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 12:02:18,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654855918] [2024-10-13 12:02:18,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:18,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:02:18,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:18,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:02:18,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:02:18,040 INFO L87 Difference]: Start difference. First operand 1120 states and 1342 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:19,133 INFO L93 Difference]: Finished difference Result 1129 states and 1356 transitions. [2024-10-13 12:02:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:02:19,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-13 12:02:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:19,138 INFO L225 Difference]: With dead ends: 1129 [2024-10-13 12:02:19,138 INFO L226 Difference]: Without dead ends: 1129 [2024-10-13 12:02:19,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 12:02:19,139 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 4 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:19,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5481 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:02:19,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-13 12:02:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1128. [2024-10-13 12:02:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 664 states have (on average 1.9698795180722892) internal successors, (1308), 1115 states have internal predecessors, (1308), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 12:02:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1355 transitions. [2024-10-13 12:02:19,152 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1355 transitions. Word has length 65 [2024-10-13 12:02:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:19,153 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1355 transitions. [2024-10-13 12:02:19,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1355 transitions. [2024-10-13 12:02:19,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 12:02:19,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:19,154 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:19,164 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 (19)] Ended with exit code 0 [2024-10-13 12:02:19,354 WARN L453 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 [2024-10-13 12:02:19,354 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:19,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:19,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1499864703, now seen corresponding path program 2 times [2024-10-13 12:02:19,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:19,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324317522] [2024-10-13 12:02:19,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:02:19,355 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 [2024-10-13 12:02:19,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:19,357 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) [2024-10-13 12:02:19,358 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 [2024-10-13 12:02:19,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:02:19,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:19,720 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:02:19,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:19,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:19,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:19,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:19,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324317522] [2024-10-13 12:02:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324317522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:19,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:19,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 12:02:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900301540] [2024-10-13 12:02:19,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:19,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 12:02:19,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:19,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 12:02:19,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 12:02:19,896 INFO L87 Difference]: Start difference. First operand 1128 states and 1355 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:21,359 INFO L93 Difference]: Finished difference Result 1140 states and 1374 transitions. [2024-10-13 12:02:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 12:02:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-13 12:02:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:21,364 INFO L225 Difference]: With dead ends: 1140 [2024-10-13 12:02:21,364 INFO L226 Difference]: Without dead ends: 1138 [2024-10-13 12:02:21,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 12:02:21,365 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 7 mSDsluCounter, 5482 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6397 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:21,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6397 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 12:02:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-10-13 12:02:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1137. [2024-10-13 12:02:21,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 673 states have (on average 1.9613670133729568) internal successors, (1320), 1124 states have internal predecessors, (1320), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 12:02:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1367 transitions. [2024-10-13 12:02:21,381 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1367 transitions. Word has length 68 [2024-10-13 12:02:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:21,381 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1367 transitions. [2024-10-13 12:02:21,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1367 transitions. [2024-10-13 12:02:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 12:02:21,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:21,382 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:21,393 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 (20)] Ended with exit code 0 [2024-10-13 12:02:21,583 WARN L453 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 [2024-10-13 12:02:21,583 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:21,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -763399167, now seen corresponding path program 3 times [2024-10-13 12:02:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981914780] [2024-10-13 12:02:21,584 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:02:21,584 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 [2024-10-13 12:02:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:21,587 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) [2024-10-13 12:02:21,589 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 [2024-10-13 12:02:22,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 12:02:22,182 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:22,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:02:22,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:22,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:22,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:22,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981914780] [2024-10-13 12:02:22,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981914780] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:22,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 12:02:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401577907] [2024-10-13 12:02:22,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:22,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 12:02:22,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:22,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 12:02:22,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 12:02:22,752 INFO L87 Difference]: Start difference. First operand 1137 states and 1367 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:26,116 INFO L93 Difference]: Finished difference Result 1158 states and 1403 transitions. [2024-10-13 12:02:26,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 12:02:26,117 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-13 12:02:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:26,120 INFO L225 Difference]: With dead ends: 1158 [2024-10-13 12:02:26,120 INFO L226 Difference]: Without dead ends: 1155 [2024-10-13 12:02:26,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 12:02:26,123 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 14 mSDsluCounter, 10965 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11880 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:26,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11880 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-13 12:02:26,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-10-13 12:02:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2024-10-13 12:02:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 691 states have (on average 1.9435600578871202) internal successors, (1343), 1142 states have internal predecessors, (1343), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 12:02:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1390 transitions. [2024-10-13 12:02:26,138 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1390 transitions. Word has length 74 [2024-10-13 12:02:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:26,138 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1390 transitions. [2024-10-13 12:02:26,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1390 transitions. [2024-10-13 12:02:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 12:02:26,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:26,139 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:26,152 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 [2024-10-13 12:02:26,340 WARN L453 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 [2024-10-13 12:02:26,340 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:26,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:26,341 INFO L85 PathProgramCache]: Analyzing trace with hash -148178687, now seen corresponding path program 4 times [2024-10-13 12:02:26,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:26,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1016495264] [2024-10-13 12:02:26,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 12:02:26,341 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 [2024-10-13 12:02:26,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:26,342 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) [2024-10-13 12:02:26,343 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 [2024-10-13 12:02:26,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 12:02:26,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:26,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 12:02:26,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:27,101 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:02:28,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1016495264] [2024-10-13 12:02:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1016495264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:02:28,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:02:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 12:02:28,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511467780] [2024-10-13 12:02:28,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:02:28,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 12:02:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:02:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 12:02:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 12:02:28,268 INFO L87 Difference]: Start difference. First operand 1155 states and 1390 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:02:36,442 INFO L93 Difference]: Finished difference Result 1192 states and 1459 transitions. [2024-10-13 12:02:36,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 12:02:36,445 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-13 12:02:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:02:36,452 INFO L225 Difference]: With dead ends: 1192 [2024-10-13 12:02:36,452 INFO L226 Difference]: Without dead ends: 1190 [2024-10-13 12:02:36,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 12:02:36,454 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 26 mSDsluCounter, 21022 mSDsCounter, 0 mSdLazyCounter, 4357 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21937 SdHoareTripleChecker+Invalid, 4405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-13 12:02:36,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21937 Invalid, 4405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4357 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-13 12:02:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-10-13 12:02:36,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1189. [2024-10-13 12:02:36,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 725 states have (on average 1.9158620689655173) internal successors, (1389), 1176 states have internal predecessors, (1389), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 12:02:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1436 transitions. [2024-10-13 12:02:36,476 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1436 transitions. Word has length 86 [2024-10-13 12:02:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:02:36,476 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1436 transitions. [2024-10-13 12:02:36,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 12:02:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1436 transitions. [2024-10-13 12:02:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 12:02:36,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:02:36,477 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:02:36,491 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 [2024-10-13 12:02:36,678 WARN L453 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 [2024-10-13 12:02:36,678 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 12:02:36,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:02:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1335212159, now seen corresponding path program 5 times [2024-10-13 12:02:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:02:36,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91016596] [2024-10-13 12:02:36,679 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:02:36,679 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 [2024-10-13 12:02:36,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:02:36,682 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) [2024-10-13 12:02:36,684 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 [2024-10-13 12:02:37,815 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 12:02:37,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:02:37,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 12:02:37,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:02:37,854 INFO L378 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 [2024-10-13 12:02:37,991 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 12:02:37,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 12:02:38,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:02:38,083 INFO L378 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 24 treesize of output 12 [2024-10-13 12:02:39,067 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 12:02:39,068 INFO L378 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 44 treesize of output 43 [2024-10-13 12:02:39,122 INFO L378 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 33 treesize of output 15 [2024-10-13 12:02:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 12:02:39,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:02:39,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:02:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91016596] [2024-10-13 12:02:39,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91016596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 12:02:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1671640605] [2024-10-13 12:02:39,517 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 12:02:39,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 12:02:39,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 12:02:39,520 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 12:02:39,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process