./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.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 c9492eb5ff634b400a7a5ea3f7f2cefeb5465f9e5361bb81d240cec0c0c035af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:04:33,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:04:34,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:04:34,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:04:34,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:04:34,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:04:34,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:04:34,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:04:34,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:04:34,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:04:34,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:04:34,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:04:34,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:04:34,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:04:34,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:04:34,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:04:34,101 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:04:34,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:04:34,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:04:34,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:04:34,102 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:04:34,103 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:04:34,103 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:04:34,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:04:34,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:04:34,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:04:34,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:04:34,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:04:34,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:04:34,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:04:34,106 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:04:34,106 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:04:34,106 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:04:34,107 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:34,107 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:04:34,107 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:04:34,108 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:04:34,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:04:34,108 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:04:34,108 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:04:34,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:04:34,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:04:34,109 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 -> c9492eb5ff634b400a7a5ea3f7f2cefeb5465f9e5361bb81d240cec0c0c035af [2024-11-19 09:04:34,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:04:34,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:04:34,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:04:34,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:04:34,410 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:04:34,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i [2024-11-19 09:04:35,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:04:36,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:04:36,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i [2024-11-19 09:04:36,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff089af03/769e5a1fb3044fd1bc217324f70127b7/FLAG14e8ed145 [2024-11-19 09:04:36,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff089af03/769e5a1fb3044fd1bc217324f70127b7 [2024-11-19 09:04:36,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:04:36,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:04:36,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:36,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:04:36,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:04:36,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:36" (1/1) ... [2024-11-19 09:04:36,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5975bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:36, skipping insertion in model container [2024-11-19 09:04:36,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:36" (1/1) ... [2024-11-19 09:04:36,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:04:36,921 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:36,957 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:36,962 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:36,967 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:36,975 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,040 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,043 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,045 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,057 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,105 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,107 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,134 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,135 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,148 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,149 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,151 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,151 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,169 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,170 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,172 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,174 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,176 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,177 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,177 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,183 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,190 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:37,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:37,232 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-11-19 09:04:37,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bfc3616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:37, skipping insertion in model container [2024-11-19 09:04:37,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:37,233 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:04:37,235 INFO L158 Benchmark]: Toolchain (without parser) took 877.59ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 124.5MB in the end (delta: -47.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-19 09:04:37,236 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory was 94.3MB in the beginning and 94.1MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:04:37,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 875.23ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 124.5MB in the end (delta: -47.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-19 09:04:37,239 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.21ms. Allocated memory is still 134.2MB. Free memory was 94.3MB in the beginning and 94.1MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 875.23ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 77.1MB in the beginning and 124.5MB in the end (delta: -47.4MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.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 c9492eb5ff634b400a7a5ea3f7f2cefeb5465f9e5361bb81d240cec0c0c035af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:04:39,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:04:39,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:04:39,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:04:39,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:04:39,484 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:04:39,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:04:39,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:04:39,486 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:04:39,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:04:39,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:04:39,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:04:39,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:04:39,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:04:39,489 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:04:39,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:04:39,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:04:39,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:04:39,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:04:39,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:04:39,492 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:04:39,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:04:39,493 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:04:39,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:04:39,494 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:04:39,494 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:04:39,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:04:39,495 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:04:39,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:04:39,495 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:04:39,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:04:39,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:04:39,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:04:39,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:04:39,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:04:39,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:39,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:04:39,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:04:39,498 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:04:39,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:04:39,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:04:39,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:04:39,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:04:39,500 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:04:39,500 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 -> c9492eb5ff634b400a7a5ea3f7f2cefeb5465f9e5361bb81d240cec0c0c035af [2024-11-19 09:04:39,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:04:39,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:04:39,871 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:04:39,872 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:04:39,872 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:04:39,873 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i [2024-11-19 09:04:41,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:04:41,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:04:41,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-3.i [2024-11-19 09:04:41,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a279b65/aedef4004c924f22829298ec8b11583c/FLAG1655e05a3 [2024-11-19 09:04:42,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28a279b65/aedef4004c924f22829298ec8b11583c [2024-11-19 09:04:42,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:04:42,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:04:42,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:42,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:04:42,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:04:42,106 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:42" (1/1) ... [2024-11-19 09:04:42,107 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52bdac9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:42, skipping insertion in model container [2024-11-19 09:04:42,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:04:42" (1/1) ... [2024-11-19 09:04:42,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:04:42,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,741 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,752 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,759 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,767 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,808 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,811 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,813 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,818 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,863 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,866 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,870 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,892 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,893 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,895 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,896 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,906 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,908 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,909 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,918 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,919 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,921 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,921 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,922 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,924 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,926 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,927 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,930 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,931 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,932 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,933 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,937 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:42,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:42,972 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:04:42,988 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:04:43,015 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,032 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,039 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,042 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,077 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,079 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,086 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,102 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,111 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,112 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,117 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,118 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,120 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,125 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,126 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,128 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,129 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,129 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,133 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,133 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,134 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,134 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,137 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,138 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,139 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,140 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:04:43,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:43,155 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:04:43,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:04:43,338 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:04:43,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43 WrapperNode [2024-11-19 09:04:43,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:04:43,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:04:43,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:04:43,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:04:43,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,399 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,505 INFO L138 Inliner]: procedures = 180, calls = 606, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2586 [2024-11-19 09:04:43,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:04:43,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:04:43,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:04:43,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:04:43,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,710 INFO L175 MemorySlicer]: Split 574 memory accesses to 3 slices as follows [2, 106, 466]. 81 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 102 writes are split as follows [0, 4, 98]. [2024-11-19 09:04:43,711 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,804 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,840 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:04:43,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:04:43,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:04:43,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:04:43,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (1/1) ... [2024-11-19 09:04:43,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:04:43,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:04:43,931 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-11-19 09:04:43,934 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-11-19 09:04:43,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 09:04:43,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 09:04:43,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 09:04:43,975 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-11-19 09:04:43,975 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-11-19 09:04:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:04:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:04:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:04:43,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 09:04:43,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 09:04:43,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 09:04:43,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 09:04:43,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 09:04:43,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 09:04:43,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 09:04:43,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:04:43,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:04:43,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:04:43,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:04:44,297 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:04:44,299 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:04:44,363 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:44,392 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:44,415 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 09:04:51,826 INFO L? ?]: Removed 2434 outVars from TransFormulas that were not future-live. [2024-11-19 09:04:51,826 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:04:51,881 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:04:51,882 INFO L316 CfgBuilder]: Removed 168 assume(true) statements. [2024-11-19 09:04:51,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:04:51 BoogieIcfgContainer [2024-11-19 09:04:51,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:04:51,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:04:51,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:04:51,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:04:51,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:04:42" (1/3) ... [2024-11-19 09:04:51,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f134760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:04:51, skipping insertion in model container [2024-11-19 09:04:51,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:04:43" (2/3) ... [2024-11-19 09:04:51,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f134760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:04:51, skipping insertion in model container [2024-11-19 09:04:51,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:04:51" (3/3) ... [2024-11-19 09:04:51,891 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-3.i [2024-11-19 09:04:51,907 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:04:51,908 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1189 error locations. [2024-11-19 09:04:51,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:04:52,002 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;@9202cf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:04:52,004 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1189 error locations. [2024-11-19 09:04:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 2457 states, 1256 states have (on average 2.200636942675159) internal successors, (2764), 2443 states have internal predecessors, (2764), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 09:04:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:04:52,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:52,021 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:04:52,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:04:52,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:52,026 INFO L85 PathProgramCache]: Analyzing trace with hash 84472, now seen corresponding path program 1 times [2024-11-19 09:04:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:52,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282394451] [2024-11-19 09:04:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:52,038 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-11-19 09:04:52,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:52,041 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-11-19 09:04:52,043 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-11-19 09:04:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:52,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:04:52,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:52,333 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-11-19 09:04:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:52,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:52,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:52,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282394451] [2024-11-19 09:04:52,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282394451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:52,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:52,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:52,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832364728] [2024-11-19 09:04:52,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:52,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:52,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:52,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:52,389 INFO L87 Difference]: Start difference. First operand has 2457 states, 1256 states have (on average 2.200636942675159) internal successors, (2764), 2443 states have internal predecessors, (2764), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-19 09:04:55,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:04:55,694 INFO L93 Difference]: Finished difference Result 3292 states and 3492 transitions. [2024-11-19 09:04:55,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:04:55,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-19 09:04:55,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:04:55,724 INFO L225 Difference]: With dead ends: 3292 [2024-11-19 09:04:55,724 INFO L226 Difference]: Without dead ends: 3290 [2024-11-19 09:04:55,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-19 09:04:55,729 INFO L432 NwaCegarLoop]: 1676 mSDtfsCounter, 2320 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2330 SdHoareTripleChecker+Valid, 2247 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:04:55,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2330 Valid, 2247 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 09:04:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3290 states. [2024-11-19 09:04:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3290 to 2601. [2024-11-19 09:04:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2601 states, 1428 states have (on average 2.03781512605042) internal successors, (2910), 2585 states have internal predecessors, (2910), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 09:04:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 2942 transitions. [2024-11-19 09:04:55,877 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 2942 transitions. Word has length 3 [2024-11-19 09:04:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:04:55,878 INFO L471 AbstractCegarLoop]: Abstraction has 2601 states and 2942 transitions. [2024-11-19 09:04:55,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-19 09:04:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 2942 transitions. [2024-11-19 09:04:55,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 09:04:55,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:04:55,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 09:04:55,885 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-11-19 09:04:56,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-11-19 09:04:56,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:04:56,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:04:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 84473, now seen corresponding path program 1 times [2024-11-19 09:04:56,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:04:56,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359400363] [2024-11-19 09:04:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:04:56,082 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-11-19 09:04:56,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:04:56,103 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-11-19 09:04:56,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-11-19 09:04:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:04:56,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:04:56,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:04:56,288 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-11-19 09:04:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:04:56,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:04:56,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:04:56,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359400363] [2024-11-19 09:04:56,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359400363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:04:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:04:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:04:56,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039073526] [2024-11-19 09:04:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:04:56,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:04:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:04:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:04:56,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:04:56,303 INFO L87 Difference]: Start difference. First operand 2601 states and 2942 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-19 09:05:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:00,041 INFO L93 Difference]: Finished difference Result 3402 states and 3823 transitions. [2024-11-19 09:05:00,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:00,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-19 09:05:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:00,052 INFO L225 Difference]: With dead ends: 3402 [2024-11-19 09:05:00,052 INFO L226 Difference]: Without dead ends: 3402 [2024-11-19 09:05:00,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-19 09:05:00,054 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 875 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1519 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3631 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:00,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3631 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1519 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-19 09:05:00,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2024-11-19 09:05:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3074. [2024-11-19 09:05:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3074 states, 1899 states have (on average 1.9931542917324907) internal successors, (3785), 3055 states have internal predecessors, (3785), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-19 09:05:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3074 states to 3074 states and 3823 transitions. [2024-11-19 09:05:00,114 INFO L78 Accepts]: Start accepts. Automaton has 3074 states and 3823 transitions. Word has length 3 [2024-11-19 09:05:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:00,114 INFO L471 AbstractCegarLoop]: Abstraction has 3074 states and 3823 transitions. [2024-11-19 09:05:00,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-11-19 09:05:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 3823 transitions. [2024-11-19 09:05:00,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 09:05:00,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:00,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:00,119 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-11-19 09:05:00,315 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-11-19 09:05:00,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:00,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:00,316 INFO L85 PathProgramCache]: Analyzing trace with hash 703308354, now seen corresponding path program 1 times [2024-11-19 09:05:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922686192] [2024-11-19 09:05:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:00,317 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-11-19 09:05:00,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:00,321 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-11-19 09:05:00,322 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-11-19 09:05:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:00,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:05:00,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:00,526 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-11-19 09:05:00,532 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-11-19 09:05:00,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:05:00,624 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-11-19 09:05:00,641 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:05:00,642 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-11-19 09:05:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:00,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:00,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:00,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922686192] [2024-11-19 09:05:00,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922686192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:00,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:00,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054811466] [2024-11-19 09:05:00,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:00,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:00,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:00,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:00,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:00,668 INFO L87 Difference]: Start difference. First operand 3074 states and 3823 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-11-19 09:05:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:07,827 INFO L93 Difference]: Finished difference Result 5339 states and 6238 transitions. [2024-11-19 09:05:07,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:07,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-11-19 09:05:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:07,842 INFO L225 Difference]: With dead ends: 5339 [2024-11-19 09:05:07,842 INFO L226 Difference]: Without dead ends: 5339 [2024-11-19 09:05:07,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-11-19 09:05:07,843 INFO L432 NwaCegarLoop]: 1182 mSDtfsCounter, 2384 mSDsluCounter, 2217 mSDsCounter, 0 mSdLazyCounter, 4325 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2393 SdHoareTripleChecker+Valid, 3399 SdHoareTripleChecker+Invalid, 4350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 4325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:07,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2393 Valid, 3399 Invalid, 4350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 4325 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2024-11-19 09:05:07,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2024-11-19 09:05:07,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 3794. [2024-11-19 09:05:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 2619 states have (on average 2.020236731576938) internal successors, (5291), 3769 states have internal predecessors, (5291), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 5341 transitions. [2024-11-19 09:05:07,924 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 5341 transitions. Word has length 7 [2024-11-19 09:05:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:07,925 INFO L471 AbstractCegarLoop]: Abstraction has 3794 states and 5341 transitions. [2024-11-19 09:05:07,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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-11-19 09:05:07,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 5341 transitions. [2024-11-19 09:05:07,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:05:07,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:07,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:07,930 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-11-19 09:05:08,126 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-11-19 09:05:08,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:08,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:08,127 INFO L85 PathProgramCache]: Analyzing trace with hash 327722514, now seen corresponding path program 1 times [2024-11-19 09:05:08,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:08,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019821340] [2024-11-19 09:05:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:08,128 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-11-19 09:05:08,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:08,131 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-11-19 09:05:08,134 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-11-19 09:05:08,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:08,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:08,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:08,315 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-11-19 09:05:08,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:08,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:08,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019821340] [2024-11-19 09:05:08,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019821340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:08,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:05:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847187396] [2024-11-19 09:05:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:08,333 INFO L87 Difference]: Start difference. First operand 3794 states and 5341 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 09:05:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:10,848 INFO L93 Difference]: Finished difference Result 4506 states and 6011 transitions. [2024-11-19 09:05:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:10,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 09:05:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:10,864 INFO L225 Difference]: With dead ends: 4506 [2024-11-19 09:05:10,864 INFO L226 Difference]: Without dead ends: 4506 [2024-11-19 09:05:10,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-19 09:05:10,865 INFO L432 NwaCegarLoop]: 2413 mSDtfsCounter, 1920 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 1615 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:10,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 3181 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1615 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 09:05:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4506 states. [2024-11-19 09:05:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4506 to 3702. [2024-11-19 09:05:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2619 states have (on average 1.9381443298969072) internal successors, (5076), 3677 states have internal predecessors, (5076), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:10,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5126 transitions. [2024-11-19 09:05:10,940 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5126 transitions. Word has length 8 [2024-11-19 09:05:10,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:10,940 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5126 transitions. [2024-11-19 09:05:10,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 09:05:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5126 transitions. [2024-11-19 09:05:10,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 09:05:10,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:10,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:10,946 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-11-19 09:05:11,141 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-11-19 09:05:11,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:11,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:11,142 INFO L85 PathProgramCache]: Analyzing trace with hash 327722515, now seen corresponding path program 1 times [2024-11-19 09:05:11,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:11,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816987161] [2024-11-19 09:05:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:11,143 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-11-19 09:05:11,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:11,145 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-11-19 09:05:11,146 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-11-19 09:05:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:11,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:11,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:11,317 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-11-19 09:05:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:11,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:11,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816987161] [2024-11-19 09:05:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816987161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:11,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:05:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837438061] [2024-11-19 09:05:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:11,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:11,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:11,348 INFO L87 Difference]: Start difference. First operand 3702 states and 5126 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 09:05:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:14,855 INFO L93 Difference]: Finished difference Result 5507 states and 7586 transitions. [2024-11-19 09:05:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:14,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-19 09:05:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:14,875 INFO L225 Difference]: With dead ends: 5507 [2024-11-19 09:05:14,875 INFO L226 Difference]: Without dead ends: 5507 [2024-11-19 09:05:14,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-11-19 09:05:14,876 INFO L432 NwaCegarLoop]: 2765 mSDtfsCounter, 1423 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 3968 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:14,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1427 Valid, 3968 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 09:05:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5507 states. [2024-11-19 09:05:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5507 to 4046. [2024-11-19 09:05:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4046 states, 2973 states have (on average 1.922637066935755) internal successors, (5716), 4021 states have internal predecessors, (5716), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4046 states to 4046 states and 5766 transitions. [2024-11-19 09:05:14,978 INFO L78 Accepts]: Start accepts. Automaton has 4046 states and 5766 transitions. Word has length 8 [2024-11-19 09:05:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:14,978 INFO L471 AbstractCegarLoop]: Abstraction has 4046 states and 5766 transitions. [2024-11-19 09:05:14,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11-19 09:05:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 4046 states and 5766 transitions. [2024-11-19 09:05:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 09:05:14,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:14,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:14,984 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-11-19 09:05:15,183 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-11-19 09:05:15,183 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:15,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash -582246585, now seen corresponding path program 1 times [2024-11-19 09:05:15,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:15,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125075903] [2024-11-19 09:05:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:15,185 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-11-19 09:05:15,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:15,187 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-11-19 09:05:15,188 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-11-19 09:05:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:15,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:05:15,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:15,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:15,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:15,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125075903] [2024-11-19 09:05:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125075903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865888337] [2024-11-19 09:05:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:15,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:15,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:15,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:15,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:15,380 INFO L87 Difference]: Start difference. First operand 4046 states and 5766 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-11-19 09:05:15,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:15,426 INFO L93 Difference]: Finished difference Result 3986 states and 5680 transitions. [2024-11-19 09:05:15,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:15,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2024-11-19 09:05:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:15,439 INFO L225 Difference]: With dead ends: 3986 [2024-11-19 09:05:15,440 INFO L226 Difference]: Without dead ends: 3986 [2024-11-19 09:05:15,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-19 09:05:15,441 INFO L432 NwaCegarLoop]: 2419 mSDtfsCounter, 71 mSDsluCounter, 2356 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4775 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:15,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4775 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:15,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-11-19 09:05:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3986. [2024-11-19 09:05:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3986 states, 2937 states have (on average 1.9169220292815798) internal successors, (5630), 3961 states have internal predecessors, (5630), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3986 states to 3986 states and 5680 transitions. [2024-11-19 09:05:15,503 INFO L78 Accepts]: Start accepts. Automaton has 3986 states and 5680 transitions. Word has length 11 [2024-11-19 09:05:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:15,503 INFO L471 AbstractCegarLoop]: Abstraction has 3986 states and 5680 transitions. [2024-11-19 09:05:15,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-11-19 09:05:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3986 states and 5680 transitions. [2024-11-19 09:05:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 09:05:15,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:15,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:05:15,512 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-11-19 09:05:15,704 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-11-19 09:05:15,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:15,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1193166111, now seen corresponding path program 1 times [2024-11-19 09:05:15,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:15,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133572254] [2024-11-19 09:05:15,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:15,706 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-11-19 09:05:15,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:15,707 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-11-19 09:05:15,708 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-11-19 09:05:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:15,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:15,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:15,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:15,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133572254] [2024-11-19 09:05:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133572254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080193391] [2024-11-19 09:05:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:15,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:15,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:15,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:15,913 INFO L87 Difference]: Start difference. First operand 3986 states and 5680 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-11-19 09:05:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:16,007 INFO L93 Difference]: Finished difference Result 3956 states and 5622 transitions. [2024-11-19 09:05:16,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:16,009 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-11-19 09:05:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:16,023 INFO L225 Difference]: With dead ends: 3956 [2024-11-19 09:05:16,026 INFO L226 Difference]: Without dead ends: 3956 [2024-11-19 09:05:16,027 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-11-19 09:05:16,027 INFO L432 NwaCegarLoop]: 2374 mSDtfsCounter, 48 mSDsluCounter, 4722 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7096 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:16,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7096 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3956 states. [2024-11-19 09:05:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3956 to 3956. [2024-11-19 09:05:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3956 states, 2921 states have (on average 1.907565902088326) internal successors, (5572), 3931 states have internal predecessors, (5572), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:16,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3956 states to 3956 states and 5622 transitions. [2024-11-19 09:05:16,099 INFO L78 Accepts]: Start accepts. Automaton has 3956 states and 5622 transitions. Word has length 13 [2024-11-19 09:05:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:16,099 INFO L471 AbstractCegarLoop]: Abstraction has 3956 states and 5622 transitions. [2024-11-19 09:05:16,099 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-11-19 09:05:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3956 states and 5622 transitions. [2024-11-19 09:05:16,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:05:16,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:16,101 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] [2024-11-19 09:05:16,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:16,304 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-11-19 09:05:16,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:16,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash -555227553, now seen corresponding path program 1 times [2024-11-19 09:05:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704707149] [2024-11-19 09:05:16,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:16,306 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-11-19 09:05:16,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:16,308 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-11-19 09:05:16,309 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-11-19 09:05:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:16,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:05:16,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:16,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:16,523 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:16,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:16,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704707149] [2024-11-19 09:05:16,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704707149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:16,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:16,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:16,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298049034] [2024-11-19 09:05:16,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:16,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:16,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:16,525 INFO L87 Difference]: Start difference. First operand 3956 states and 5622 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-11-19 09:05:16,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:16,560 INFO L93 Difference]: Finished difference Result 3824 states and 5364 transitions. [2024-11-19 09:05:16,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:16,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-19 09:05:16,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:16,570 INFO L225 Difference]: With dead ends: 3824 [2024-11-19 09:05:16,570 INFO L226 Difference]: Without dead ends: 3824 [2024-11-19 09:05:16,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-11-19 09:05:16,571 INFO L432 NwaCegarLoop]: 2341 mSDtfsCounter, 71 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4619 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:16,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4619 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3824 states. [2024-11-19 09:05:16,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3824 to 3824. [2024-11-19 09:05:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 2813 states have (on average 1.8890863846427302) internal successors, (5314), 3799 states have internal predecessors, (5314), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5364 transitions. [2024-11-19 09:05:16,625 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5364 transitions. Word has length 20 [2024-11-19 09:05:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:16,626 INFO L471 AbstractCegarLoop]: Abstraction has 3824 states and 5364 transitions. [2024-11-19 09:05:16,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-11-19 09:05:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5364 transitions. [2024-11-19 09:05:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 09:05:16,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:16,627 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] [2024-11-19 09:05:16,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:16,827 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-11-19 09:05:16,828 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:16,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash -286362849, now seen corresponding path program 1 times [2024-11-19 09:05:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:16,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820892873] [2024-11-19 09:05:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:16,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:16,833 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-11-19 09:05:16,835 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-11-19 09:05:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:17,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 09:05:17,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:17,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:17,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820892873] [2024-11-19 09:05:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820892873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926645756] [2024-11-19 09:05:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:17,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:17,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:17,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:17,053 INFO L87 Difference]: Start difference. First operand 3824 states and 5364 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-11-19 09:05:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:17,089 INFO L93 Difference]: Finished difference Result 3764 states and 5278 transitions. [2024-11-19 09:05:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-19 09:05:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:17,097 INFO L225 Difference]: With dead ends: 3764 [2024-11-19 09:05:17,098 INFO L226 Difference]: Without dead ends: 3764 [2024-11-19 09:05:17,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-11-19 09:05:17,099 INFO L432 NwaCegarLoop]: 2298 mSDtfsCounter, 71 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 4533 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:17,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 4533 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2024-11-19 09:05:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2024-11-19 09:05:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 2777 states have (on average 1.882607129996399) internal successors, (5228), 3739 states have internal predecessors, (5228), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:17,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5278 transitions. [2024-11-19 09:05:17,157 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5278 transitions. Word has length 20 [2024-11-19 09:05:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 3764 states and 5278 transitions. [2024-11-19 09:05:17,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-11-19 09:05:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5278 transitions. [2024-11-19 09:05:17,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 09:05:17,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:17,160 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] [2024-11-19 09:05:17,167 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-11-19 09:05:17,361 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-11-19 09:05:17,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:17,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:17,362 INFO L85 PathProgramCache]: Analyzing trace with hash -997708103, now seen corresponding path program 1 times [2024-11-19 09:05:17,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:17,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836829501] [2024-11-19 09:05:17,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:17,367 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-11-19 09:05:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:17,369 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-11-19 09:05:17,371 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-11-19 09:05:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:17,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:17,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:17,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:17,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:17,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836829501] [2024-11-19 09:05:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836829501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:17,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:17,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:17,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684784495] [2024-11-19 09:05:17,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:17,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:17,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:17,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:17,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:17,625 INFO L87 Difference]: Start difference. First operand 3764 states and 5278 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-11-19 09:05:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:17,714 INFO L93 Difference]: Finished difference Result 3702 states and 5104 transitions. [2024-11-19 09:05:17,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:17,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-19 09:05:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:17,722 INFO L225 Difference]: With dead ends: 3702 [2024-11-19 09:05:17,723 INFO L226 Difference]: Without dead ends: 3702 [2024-11-19 09:05:17,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-11-19 09:05:17,723 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 48 mSDsluCounter, 4480 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6733 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:17,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6733 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:05:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2024-11-19 09:05:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3702. [2024-11-19 09:05:17,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3702 states, 2729 states have (on average 1.851960425064126) internal successors, (5054), 3677 states have internal predecessors, (5054), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3702 states to 3702 states and 5104 transitions. [2024-11-19 09:05:17,791 INFO L78 Accepts]: Start accepts. Automaton has 3702 states and 5104 transitions. Word has length 22 [2024-11-19 09:05:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 3702 states and 5104 transitions. [2024-11-19 09:05:17,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-11-19 09:05:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3702 states and 5104 transitions. [2024-11-19 09:05:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 09:05:17,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:17,796 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] [2024-11-19 09:05:17,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:17,996 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-11-19 09:05:17,997 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:17,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:17,998 INFO L85 PathProgramCache]: Analyzing trace with hash -316792903, now seen corresponding path program 1 times [2024-11-19 09:05:17,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:17,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723981074] [2024-11-19 09:05:17,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:17,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:17,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:18,013 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-11-19 09:05:18,015 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-11-19 09:05:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:18,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:18,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:18,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-11-19 09:05:18,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:18,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:18,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723981074] [2024-11-19 09:05:18,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723981074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:18,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:18,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548884586] [2024-11-19 09:05:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:18,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:18,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:18,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:18,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:18,256 INFO L87 Difference]: Start difference. First operand 3702 states and 5104 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-11-19 09:05:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:18,348 INFO L93 Difference]: Finished difference Result 3672 states and 5046 transitions. [2024-11-19 09:05:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:18,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-11-19 09:05:18,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:18,355 INFO L225 Difference]: With dead ends: 3672 [2024-11-19 09:05:18,355 INFO L226 Difference]: Without dead ends: 3672 [2024-11-19 09:05:18,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-11-19 09:05:18,356 INFO L432 NwaCegarLoop]: 2218 mSDtfsCounter, 48 mSDsluCounter, 4410 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 6628 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:18,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 6628 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:05:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-11-19 09:05:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2024-11-19 09:05:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2713 states have (on average 1.841503870254331) internal successors, (4996), 3647 states have internal predecessors, (4996), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5046 transitions. [2024-11-19 09:05:18,412 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5046 transitions. Word has length 22 [2024-11-19 09:05:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:18,414 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5046 transitions. [2024-11-19 09:05:18,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-11-19 09:05:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5046 transitions. [2024-11-19 09:05:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:05:18,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:18,415 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] [2024-11-19 09:05:18,422 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-11-19 09:05:18,615 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-11-19 09:05:18,616 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:18,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash -544433649, now seen corresponding path program 1 times [2024-11-19 09:05:18,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:18,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952008225] [2024-11-19 09:05:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:18,619 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-11-19 09:05:18,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:18,622 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-11-19 09:05:18,623 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-11-19 09:05:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:18,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:18,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:18,832 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-11-19 09:05:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:18,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:18,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952008225] [2024-11-19 09:05:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952008225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:18,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:18,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:18,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974870300] [2024-11-19 09:05:18,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:18,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:18,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:18,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:18,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:18,908 INFO L87 Difference]: Start difference. First operand 3672 states and 5046 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-11-19 09:05:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:22,189 INFO L93 Difference]: Finished difference Result 4290 states and 5579 transitions. [2024-11-19 09:05:22,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:22,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 09:05:22,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:22,199 INFO L225 Difference]: With dead ends: 4290 [2024-11-19 09:05:22,199 INFO L226 Difference]: Without dead ends: 4290 [2024-11-19 09:05:22,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-11-19 09:05:22,200 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 2013 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 3356 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:22,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 3356 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 09:05:22,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4290 states. [2024-11-19 09:05:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4290 to 3668. [2024-11-19 09:05:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2713 states have (on average 1.8385551050497604) internal successors, (4988), 3643 states have internal predecessors, (4988), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 5038 transitions. [2024-11-19 09:05:22,252 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 5038 transitions. Word has length 27 [2024-11-19 09:05:22,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:22,253 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 5038 transitions. [2024-11-19 09:05:22,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-11-19 09:05:22,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 5038 transitions. [2024-11-19 09:05:22,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 09:05:22,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:22,254 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] [2024-11-19 09:05:22,259 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-11-19 09:05:22,454 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-11-19 09:05:22,455 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:22,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -544433648, now seen corresponding path program 1 times [2024-11-19 09:05:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:22,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538548381] [2024-11-19 09:05:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:22,457 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-11-19 09:05:22,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:22,461 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-11-19 09:05:22,463 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-11-19 09:05:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:22,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:05:22,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:22,658 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-11-19 09:05:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:22,833 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:22,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:22,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538548381] [2024-11-19 09:05:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538548381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:22,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236193248] [2024-11-19 09:05:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:22,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:22,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:22,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:22,835 INFO L87 Difference]: Start difference. First operand 3668 states and 5038 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-11-19 09:05:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:26,614 INFO L93 Difference]: Finished difference Result 4402 states and 5844 transitions. [2024-11-19 09:05:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-19 09:05:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:26,621 INFO L225 Difference]: With dead ends: 4402 [2024-11-19 09:05:26,621 INFO L226 Difference]: Without dead ends: 4402 [2024-11-19 09:05:26,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-11-19 09:05:26,622 INFO L432 NwaCegarLoop]: 1929 mSDtfsCounter, 806 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 4303 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:26,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 4303 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-19 09:05:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4402 states. [2024-11-19 09:05:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4402 to 3704. [2024-11-19 09:05:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 2749 states have (on average 1.8293925063659513) internal successors, (5029), 3679 states have internal predecessors, (5029), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 5079 transitions. [2024-11-19 09:05:26,672 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 5079 transitions. Word has length 27 [2024-11-19 09:05:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:26,672 INFO L471 AbstractCegarLoop]: Abstraction has 3704 states and 5079 transitions. [2024-11-19 09:05:26,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-11-19 09:05:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 5079 transitions. [2024-11-19 09:05:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:05:26,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:26,673 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] [2024-11-19 09:05:26,678 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-11-19 09:05:26,874 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-11-19 09:05:26,874 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:26,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:26,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826599, now seen corresponding path program 1 times [2024-11-19 09:05:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831504404] [2024-11-19 09:05:26,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:26,876 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-11-19 09:05:26,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:26,879 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-11-19 09:05:26,881 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-11-19 09:05:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:27,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:27,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:27,134 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-11-19 09:05:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:27,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:27,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:27,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831504404] [2024-11-19 09:05:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831504404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223036047] [2024-11-19 09:05:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:27,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:27,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:27,206 INFO L87 Difference]: Start difference. First operand 3704 states and 5079 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:30,181 INFO L93 Difference]: Finished difference Result 4420 states and 5843 transitions. [2024-11-19 09:05:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:30,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-19 09:05:30,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:30,188 INFO L225 Difference]: With dead ends: 4420 [2024-11-19 09:05:30,189 INFO L226 Difference]: Without dead ends: 4420 [2024-11-19 09:05:30,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-11-19 09:05:30,190 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 1691 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 2786 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1701 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:30,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1701 Valid, 4573 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2786 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 09:05:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4420 states. [2024-11-19 09:05:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4420 to 3700. [2024-11-19 09:05:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2749 states have (on average 1.8206620589305202) internal successors, (5005), 3675 states have internal predecessors, (5005), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5055 transitions. [2024-11-19 09:05:30,228 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5055 transitions. Word has length 36 [2024-11-19 09:05:30,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:30,228 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5055 transitions. [2024-11-19 09:05:30,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5055 transitions. [2024-11-19 09:05:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:05:30,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:30,229 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] [2024-11-19 09:05:30,235 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-11-19 09:05:30,429 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-11-19 09:05:30,430 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1953826600, now seen corresponding path program 1 times [2024-11-19 09:05:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181582882] [2024-11-19 09:05:30,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:30,432 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-11-19 09:05:30,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:30,435 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-11-19 09:05:30,436 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-11-19 09:05:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:30,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:05:30,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:30,668 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-11-19 09:05:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:30,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:30,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:30,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181582882] [2024-11-19 09:05:30,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181582882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:30,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:30,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:30,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916842848] [2024-11-19 09:05:30,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:30,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:30,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:30,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:30,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:30,820 INFO L87 Difference]: Start difference. First operand 3700 states and 5055 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:35,101 INFO L93 Difference]: Finished difference Result 5029 states and 6723 transitions. [2024-11-19 09:05:35,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:35,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-19 09:05:35,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:35,108 INFO L225 Difference]: With dead ends: 5029 [2024-11-19 09:05:35,108 INFO L226 Difference]: Without dead ends: 5029 [2024-11-19 09:05:35,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-11-19 09:05:35,109 INFO L432 NwaCegarLoop]: 2555 mSDtfsCounter, 1190 mSDsluCounter, 2801 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 5356 SdHoareTripleChecker+Invalid, 2845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:35,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 5356 Invalid, 2845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2842 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-19 09:05:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2024-11-19 09:05:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 3700. [2024-11-19 09:05:35,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3700 states, 2749 states have (on average 1.8177519097853765) internal successors, (4997), 3675 states have internal predecessors, (4997), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3700 states to 3700 states and 5047 transitions. [2024-11-19 09:05:35,145 INFO L78 Accepts]: Start accepts. Automaton has 3700 states and 5047 transitions. Word has length 36 [2024-11-19 09:05:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:35,146 INFO L471 AbstractCegarLoop]: Abstraction has 3700 states and 5047 transitions. [2024-11-19 09:05:35,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3700 states and 5047 transitions. [2024-11-19 09:05:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:05:35,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:35,147 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] [2024-11-19 09:05:35,153 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-11-19 09:05:35,347 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-11-19 09:05:35,347 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:35,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988007, now seen corresponding path program 1 times [2024-11-19 09:05:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003182545] [2024-11-19 09:05:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:35,348 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-11-19 09:05:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:35,350 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-11-19 09:05:35,351 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-11-19 09:05:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:35,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:35,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:35,568 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-11-19 09:05:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:35,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:35,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:35,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003182545] [2024-11-19 09:05:35,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003182545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:35,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:35,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:35,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137082223] [2024-11-19 09:05:35,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:35,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:35,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:35,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:35,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:35,637 INFO L87 Difference]: Start difference. First operand 3700 states and 5047 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:38,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:38,892 INFO L93 Difference]: Finished difference Result 4400 states and 5811 transitions. [2024-11-19 09:05:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:38,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-19 09:05:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:38,896 INFO L225 Difference]: With dead ends: 4400 [2024-11-19 09:05:38,897 INFO L226 Difference]: Without dead ends: 4400 [2024-11-19 09:05:38,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-11-19 09:05:38,897 INFO L432 NwaCegarLoop]: 2203 mSDtfsCounter, 1687 mSDsluCounter, 2370 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 4573 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:38,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 4573 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 09:05:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4400 states. [2024-11-19 09:05:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4400 to 3696. [2024-11-19 09:05:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 2749 states have (on average 1.8148417606402327) internal successors, (4989), 3671 states have internal predecessors, (4989), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5039 transitions. [2024-11-19 09:05:38,937 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5039 transitions. Word has length 36 [2024-11-19 09:05:38,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:38,938 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 5039 transitions. [2024-11-19 09:05:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5039 transitions. [2024-11-19 09:05:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 09:05:38,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:38,939 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] [2024-11-19 09:05:38,945 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 (17)] Ended with exit code 0 [2024-11-19 09:05:39,139 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-11-19 09:05:39,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:39,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:39,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1978988008, now seen corresponding path program 1 times [2024-11-19 09:05:39,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:39,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369768302] [2024-11-19 09:05:39,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:39,141 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-11-19 09:05:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:39,144 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-11-19 09:05:39,146 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-11-19 09:05:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:39,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:05:39,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:39,425 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-11-19 09:05:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:39,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:39,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:39,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369768302] [2024-11-19 09:05:39,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369768302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:39,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:39,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:39,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636980002] [2024-11-19 09:05:39,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:39,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:39,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:39,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:39,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:39,576 INFO L87 Difference]: Start difference. First operand 3696 states and 5039 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:44,052 INFO L93 Difference]: Finished difference Result 5021 states and 6707 transitions. [2024-11-19 09:05:44,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:44,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-19 09:05:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:44,058 INFO L225 Difference]: With dead ends: 5021 [2024-11-19 09:05:44,058 INFO L226 Difference]: Without dead ends: 5021 [2024-11-19 09:05:44,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-11-19 09:05:44,059 INFO L432 NwaCegarLoop]: 2551 mSDtfsCounter, 1182 mSDsluCounter, 2767 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 5318 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:44,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 5318 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 09:05:44,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2024-11-19 09:05:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 3692. [2024-11-19 09:05:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 2749 states have (on average 1.8119316114950892) internal successors, (4981), 3667 states have internal predecessors, (4981), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:44,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 5031 transitions. [2024-11-19 09:05:44,106 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 5031 transitions. Word has length 36 [2024-11-19 09:05:44,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:44,107 INFO L471 AbstractCegarLoop]: Abstraction has 3692 states and 5031 transitions. [2024-11-19 09:05:44,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-11-19 09:05:44,107 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 5031 transitions. [2024-11-19 09:05:44,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 09:05:44,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:44,108 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] [2024-11-19 09:05:44,115 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 (18)] Ended with exit code 0 [2024-11-19 09:05:44,309 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-11-19 09:05:44,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:44,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash 841114057, now seen corresponding path program 1 times [2024-11-19 09:05:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:44,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648065136] [2024-11-19 09:05:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:44,310 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-11-19 09:05:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:44,311 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-11-19 09:05:44,312 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-11-19 09:05:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:44,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:44,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:44,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:44,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648065136] [2024-11-19 09:05:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648065136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883422112] [2024-11-19 09:05:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:44,548 INFO L87 Difference]: Start difference. First operand 3692 states and 5031 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-11-19 09:05:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:44,597 INFO L93 Difference]: Finished difference Result 3680 states and 5007 transitions. [2024-11-19 09:05:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-19 09:05:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:44,601 INFO L225 Difference]: With dead ends: 3680 [2024-11-19 09:05:44,601 INFO L226 Difference]: Without dead ends: 3680 [2024-11-19 09:05:44,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-11-19 09:05:44,602 INFO L432 NwaCegarLoop]: 2204 mSDtfsCounter, 27 mSDsluCounter, 4371 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6575 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:44,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6575 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2024-11-19 09:05:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2024-11-19 09:05:44,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 2737 states have (on average 1.8111070515162586) internal successors, (4957), 3655 states have internal predecessors, (4957), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 09:05:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5007 transitions. [2024-11-19 09:05:44,639 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5007 transitions. Word has length 41 [2024-11-19 09:05:44,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:44,639 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5007 transitions. [2024-11-19 09:05:44,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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-11-19 09:05:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5007 transitions. [2024-11-19 09:05:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 09:05:44,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:44,640 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] [2024-11-19 09:05:44,646 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-11-19 09:05:44,840 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-11-19 09:05:44,841 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:44,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash 385316629, now seen corresponding path program 1 times [2024-11-19 09:05:44,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:44,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292737491] [2024-11-19 09:05:44,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:44,842 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-11-19 09:05:44,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:44,843 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-11-19 09:05:44,845 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-11-19 09:05:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:45,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:45,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:45,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:45,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:45,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292737491] [2024-11-19 09:05:45,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292737491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:45,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:45,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:45,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272676106] [2024-11-19 09:05:45,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:45,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:45,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:45,332 INFO L87 Difference]: Start difference. First operand 3680 states and 5007 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-11-19 09:05:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:45,568 INFO L93 Difference]: Finished difference Result 5511 states and 7253 transitions. [2024-11-19 09:05:45,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 49 [2024-11-19 09:05:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:45,573 INFO L225 Difference]: With dead ends: 5511 [2024-11-19 09:05:45,573 INFO L226 Difference]: Without dead ends: 5511 [2024-11-19 09:05:45,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-11-19 09:05:45,574 INFO L432 NwaCegarLoop]: 2289 mSDtfsCounter, 1487 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1494 SdHoareTripleChecker+Valid, 4407 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:45,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1494 Valid, 4407 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 09:05:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2024-11-19 09:05:45,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 4734. [2024-11-19 09:05:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4734 states, 3784 states have (on average 1.7957188160676534) internal successors, (6795), 4699 states have internal predecessors, (6795), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:05:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 6865 transitions. [2024-11-19 09:05:45,627 INFO L78 Accepts]: Start accepts. Automaton has 4734 states and 6865 transitions. Word has length 49 [2024-11-19 09:05:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 4734 states and 6865 transitions. [2024-11-19 09:05:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-11-19 09:05:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4734 states and 6865 transitions. [2024-11-19 09:05:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 09:05:45,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:45,629 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] [2024-11-19 09:05:45,638 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-11-19 09:05:45,833 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-11-19 09:05:45,834 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash 2050666657, now seen corresponding path program 1 times [2024-11-19 09:05:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136930681] [2024-11-19 09:05:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:45,835 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-11-19 09:05:45,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:45,838 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-11-19 09:05:45,839 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-11-19 09:05:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:46,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:46,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:46,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:46,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:46,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136930681] [2024-11-19 09:05:46,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136930681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:46,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:46,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:46,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966342373] [2024-11-19 09:05:46,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:46,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:46,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:46,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:46,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:46,121 INFO L87 Difference]: Start difference. First operand 4734 states and 6865 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-11-19 09:05:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:46,199 INFO L93 Difference]: Finished difference Result 4692 states and 6795 transitions. [2024-11-19 09:05:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2024-11-19 09:05:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:46,205 INFO L225 Difference]: With dead ends: 4692 [2024-11-19 09:05:46,205 INFO L226 Difference]: Without dead ends: 4692 [2024-11-19 09:05:46,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-11-19 09:05:46,206 INFO L432 NwaCegarLoop]: 2200 mSDtfsCounter, 27 mSDsluCounter, 4363 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:46,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6563 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2024-11-19 09:05:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 4692. [2024-11-19 09:05:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4692 states, 3742 states have (on average 1.7971672902191342) internal successors, (6725), 4657 states have internal predecessors, (6725), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:05:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 6795 transitions. [2024-11-19 09:05:46,255 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 6795 transitions. Word has length 52 [2024-11-19 09:05:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:46,256 INFO L471 AbstractCegarLoop]: Abstraction has 4692 states and 6795 transitions. [2024-11-19 09:05:46,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-11-19 09:05:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 6795 transitions. [2024-11-19 09:05:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 09:05:46,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:46,257 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] [2024-11-19 09:05:46,265 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 (21)] Ended with exit code 0 [2024-11-19 09:05:46,457 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-11-19 09:05:46,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:46,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:46,459 INFO L85 PathProgramCache]: Analyzing trace with hash 705263610, now seen corresponding path program 1 times [2024-11-19 09:05:46,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:46,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889260372] [2024-11-19 09:05:46,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:46,460 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-11-19 09:05:46,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:46,464 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-11-19 09:05:46,465 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-11-19 09:05:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:46,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:46,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:46,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:46,826 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:46,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:46,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889260372] [2024-11-19 09:05:46,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889260372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:46,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:46,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:46,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825849136] [2024-11-19 09:05:46,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:46,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:46,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:46,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:46,828 INFO L87 Difference]: Start difference. First operand 4692 states and 6795 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-11-19 09:05:46,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:46,895 INFO L93 Difference]: Finished difference Result 4674 states and 6765 transitions. [2024-11-19 09:05:46,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:05:46,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2024-11-19 09:05:46,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:46,901 INFO L225 Difference]: With dead ends: 4674 [2024-11-19 09:05:46,901 INFO L226 Difference]: Without dead ends: 4674 [2024-11-19 09:05:46,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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-11-19 09:05:46,902 INFO L432 NwaCegarLoop]: 2196 mSDtfsCounter, 21 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 6557 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:46,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 6557 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 09:05:46,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4674 states. [2024-11-19 09:05:46,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4674 to 4674. [2024-11-19 09:05:46,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4674 states, 3724 states have (on average 1.797798066595059) internal successors, (6695), 4639 states have internal predecessors, (6695), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:05:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4674 states to 4674 states and 6765 transitions. [2024-11-19 09:05:46,950 INFO L78 Accepts]: Start accepts. Automaton has 4674 states and 6765 transitions. Word has length 55 [2024-11-19 09:05:46,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:46,950 INFO L471 AbstractCegarLoop]: Abstraction has 4674 states and 6765 transitions. [2024-11-19 09:05:46,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-11-19 09:05:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 4674 states and 6765 transitions. [2024-11-19 09:05:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 09:05:46,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:46,951 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] [2024-11-19 09:05:46,959 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 (22)] Ended with exit code 0 [2024-11-19 09:05:47,152 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-11-19 09:05:47,153 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:47,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1121817781, now seen corresponding path program 1 times [2024-11-19 09:05:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:47,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760429298] [2024-11-19 09:05:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:47,154 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-11-19 09:05:47,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:47,157 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-11-19 09:05:47,159 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-11-19 09:05:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:47,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:05:47,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:47,466 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:05:47,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:05:47,472 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 33 treesize of output 31 [2024-11-19 09:05:47,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:05:47,503 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 62 treesize of output 22 [2024-11-19 09:05:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:47,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:47,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:47,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760429298] [2024-11-19 09:05:47,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760429298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:47,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:47,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:47,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129232158] [2024-11-19 09:05:47,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:47,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:47,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:47,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:47,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:47,541 INFO L87 Difference]: Start difference. First operand 4674 states and 6765 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:05:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:48,269 INFO L93 Difference]: Finished difference Result 6132 states and 8780 transitions. [2024-11-19 09:05:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:48,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-19 09:05:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:48,278 INFO L225 Difference]: With dead ends: 6132 [2024-11-19 09:05:48,278 INFO L226 Difference]: Without dead ends: 6132 [2024-11-19 09:05:48,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:05:48,279 INFO L432 NwaCegarLoop]: 2318 mSDtfsCounter, 1694 mSDsluCounter, 3701 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 6019 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:48,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 6019 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 09:05:48,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6132 states. [2024-11-19 09:05:48,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6132 to 4640. [2024-11-19 09:05:48,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4640 states, 3690 states have (on average 1.8048780487804879) internal successors, (6660), 4605 states have internal predecessors, (6660), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 09:05:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4640 states to 4640 states and 6730 transitions. [2024-11-19 09:05:48,355 INFO L78 Accepts]: Start accepts. Automaton has 4640 states and 6730 transitions. Word has length 60 [2024-11-19 09:05:48,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:48,355 INFO L471 AbstractCegarLoop]: Abstraction has 4640 states and 6730 transitions. [2024-11-19 09:05:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:05:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 4640 states and 6730 transitions. [2024-11-19 09:05:48,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-19 09:05:48,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:48,356 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] [2024-11-19 09:05:48,365 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 (23)] Ended with exit code 0 [2024-11-19 09:05:48,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:48,558 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:48,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:48,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1034209811, now seen corresponding path program 1 times [2024-11-19 09:05:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:48,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663112438] [2024-11-19 09:05:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:48,559 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-11-19 09:05:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:48,562 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:05:48,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-19 09:05:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:48,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:05:48,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:49,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:49,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663112438] [2024-11-19 09:05:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663112438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636736369] [2024-11-19 09:05:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:49,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:05:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:05:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:05:49,108 INFO L87 Difference]: Start difference. First operand 4640 states and 6730 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-19 09:05:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:49,260 INFO L93 Difference]: Finished difference Result 6468 states and 9033 transitions. [2024-11-19 09:05:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:05:49,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2024-11-19 09:05:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:49,269 INFO L225 Difference]: With dead ends: 6468 [2024-11-19 09:05:49,269 INFO L226 Difference]: Without dead ends: 6468 [2024-11-19 09:05:49,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-11-19 09:05:49,270 INFO L432 NwaCegarLoop]: 2294 mSDtfsCounter, 1197 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:49,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 4443 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 09:05:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6468 states. [2024-11-19 09:05:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6468 to 5740. [2024-11-19 09:05:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5740 states, 4782 states have (on average 1.7806357172731075) internal successors, (8515), 5694 states have internal predecessors, (8515), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 09:05:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5740 states to 5740 states and 8607 transitions. [2024-11-19 09:05:49,374 INFO L78 Accepts]: Start accepts. Automaton has 5740 states and 8607 transitions. Word has length 60 [2024-11-19 09:05:49,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 5740 states and 8607 transitions. [2024-11-19 09:05:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-11-19 09:05:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 5740 states and 8607 transitions. [2024-11-19 09:05:49,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:05:49,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:49,376 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] [2024-11-19 09:05:49,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 (24)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:49,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:49,576 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1844344716, now seen corresponding path program 1 times [2024-11-19 09:05:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816385367] [2024-11-19 09:05:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:49,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:49,581 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:05:49,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-19 09:05:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:49,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:05:49,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:49,963 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:05:49,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:05:49,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:05:49,967 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-11-19 09:05:50,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:05:50,122 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-11-19 09:05:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:50,131 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:50,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:50,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816385367] [2024-11-19 09:05:50,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816385367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:50,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:50,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:05:50,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283604643] [2024-11-19 09:05:50,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:50,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:50,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:50,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:50,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:50,133 INFO L87 Difference]: Start difference. First operand 5740 states and 8607 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-11-19 09:05:50,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:50,543 INFO L93 Difference]: Finished difference Result 6064 states and 8693 transitions. [2024-11-19 09:05:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-19 09:05:50,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:50,551 INFO L225 Difference]: With dead ends: 6064 [2024-11-19 09:05:50,551 INFO L226 Difference]: Without dead ends: 6064 [2024-11-19 09:05:50,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-11-19 09:05:50,552 INFO L432 NwaCegarLoop]: 2201 mSDtfsCounter, 857 mSDsluCounter, 4286 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 6487 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:50,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 6487 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 09:05:50,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2024-11-19 09:05:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 5299. [2024-11-19 09:05:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5299 states, 4341 states have (on average 1.8007371573370192) internal successors, (7817), 5256 states have internal predecessors, (7817), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 09:05:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5299 states to 5299 states and 7903 transitions. [2024-11-19 09:05:50,628 INFO L78 Accepts]: Start accepts. Automaton has 5299 states and 7903 transitions. Word has length 63 [2024-11-19 09:05:50,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:50,628 INFO L471 AbstractCegarLoop]: Abstraction has 5299 states and 7903 transitions. [2024-11-19 09:05:50,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-11-19 09:05:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 5299 states and 7903 transitions. [2024-11-19 09:05:50,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-19 09:05:50,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:50,628 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] [2024-11-19 09:05:50,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:50,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:50,829 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:50,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:50,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1265725906, now seen corresponding path program 1 times [2024-11-19 09:05:50,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:50,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182135192] [2024-11-19 09:05:50,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:50,831 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-11-19 09:05:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:50,834 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:05:50,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-19 09:05:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:05:51,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:05:51,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:05:51,199 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-11-19 09:05:51,206 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-11-19 09:05:51,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:05:51,710 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-11-19 09:05:51,718 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:05:51,719 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-11-19 09:05:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:05:51,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:05:51,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:05:51,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182135192] [2024-11-19 09:05:51,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182135192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:05:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:05:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:05:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125717844] [2024-11-19 09:05:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:05:51,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:05:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:05:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:05:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:05:51,733 INFO L87 Difference]: Start difference. First operand 5299 states and 7903 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-11-19 09:05:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 09:05:54,248 INFO L93 Difference]: Finished difference Result 5215 states and 7660 transitions. [2024-11-19 09:05:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:05:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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 63 [2024-11-19 09:05:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 09:05:54,254 INFO L225 Difference]: With dead ends: 5215 [2024-11-19 09:05:54,254 INFO L226 Difference]: Without dead ends: 5215 [2024-11-19 09:05:54,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-11-19 09:05:54,255 INFO L432 NwaCegarLoop]: 1052 mSDtfsCounter, 3212 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3222 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 09:05:54,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3222 Valid, 1284 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 09:05:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5215 states. [2024-11-19 09:05:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5215 to 5075. [2024-11-19 09:05:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5075 states, 4201 states have (on average 1.741966198524161) internal successors, (7318), 5032 states have internal predecessors, (7318), 43 states have call successors, (43), 3 states have call predecessors, (43), 3 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 09:05:54,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5075 states to 5075 states and 7404 transitions. [2024-11-19 09:05:54,323 INFO L78 Accepts]: Start accepts. Automaton has 5075 states and 7404 transitions. Word has length 63 [2024-11-19 09:05:54,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 09:05:54,323 INFO L471 AbstractCegarLoop]: Abstraction has 5075 states and 7404 transitions. [2024-11-19 09:05:54,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 4 states have internal predecessors, (63), 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-11-19 09:05:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5075 states and 7404 transitions. [2024-11-19 09:05:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 09:05:54,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 09:05:54,324 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, 1, 1, 1] [2024-11-19 09:05:54,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-19 09:05:54,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:05:54,525 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1186 more)] === [2024-11-19 09:05:54,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:05:54,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1551615488, now seen corresponding path program 1 times [2024-11-19 09:05:54,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:05:54,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806573802] [2024-11-19 09:05:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:05:54,526 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-11-19 09:05:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:05:54,528 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:05:54,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process