./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.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_BER_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:58:15,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:58:16,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 08:58:16,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:58:16,085 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:58:16,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:58:16,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:58:16,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:58:16,127 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:58:16,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:58:16,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:58:16,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:58:16,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:58:16,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:58:16,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:58:16,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:58:16,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:58:16,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:58:16,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:58:16,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:58:16,135 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:58:16,136 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:58:16,136 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:58:16,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:58:16,137 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:58:16,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:58:16,137 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:58:16,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:58:16,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:58:16,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:58:16,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:58:16,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:58:16,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:58:16,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:58:16,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:58:16,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:58:16,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 08:58:16,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 08:58:16,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:58:16,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:58:16,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:58:16,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:58:16,147 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 -> 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 [2024-11-19 08:58:16,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:58:16,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:58:16,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:58:16,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:58:16,454 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:58:16,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-19 08:58:17,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:58:18,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:58:18,292 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-19 08:58:18,323 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06403c050/de05af9f23d3466c85a746a5e086aa4d/FLAG29fd274b1 [2024-11-19 08:58:18,341 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06403c050/de05af9f23d3466c85a746a5e086aa4d [2024-11-19 08:58:18,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:58:18,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:58:18,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:58:18,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:58:18,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:58:18,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:58:18" (1/1) ... [2024-11-19 08:58:18,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562771a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:18, skipping insertion in model container [2024-11-19 08:58:18,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:58:18" (1/1) ... [2024-11-19 08:58:18,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:58:18,868 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 08:58:18,913 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 08:58:18,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 08:58:18,925 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 08:58:18,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 08:58:18,965 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 08:58:18,965 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 08:58:18,968 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 08:58:18,969 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 08:58:18,970 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 08:58:18,972 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 08:58:18,974 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 08:58:18,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 08:58:18,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 08:58:18,979 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 08:58:18,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:58:19,001 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 08:58:19,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4af9eebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:19, skipping insertion in model container [2024-11-19 08:58:19,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:58:19,002 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 08:58:19,004 INFO L158 Benchmark]: Toolchain (without parser) took 656.78ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 77.3MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-19 08:58:19,005 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 159.4MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 08:58:19,005 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.22ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 77.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 08:58:19,007 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.10ms. Allocated memory is still 159.4MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.22ms. Allocated memory is still 159.4MB. Free memory was 100.7MB in the beginning and 77.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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_BER_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:58:21,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:58:21,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 08:58:21,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:58:21,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:58:21,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:58:21,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:58:21,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:58:21,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:58:21,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:58:21,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:58:21,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:58:21,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:58:21,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:58:21,322 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:58:21,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:58:21,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 08:58:21,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:58:21,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 08:58:21,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:58:21,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:58:21,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:58:21,326 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:58:21,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:58:21,326 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:58:21,327 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 08:58:21,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:58:21,327 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 08:58:21,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:58:21,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 08:58:21,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:58:21,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:58:21,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:58:21,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:58:21,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:58:21,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:58:21,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:58:21,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:58:21,331 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 08:58:21,331 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 08:58:21,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:58:21,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:58:21,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:58:21,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:58:21,332 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 -> 5b41ff920513b74db566933dfdd7430dbdb0b5764645b98d18d29abf93fb4135 [2024-11-19 08:58:21,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:58:21,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:58:21,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:58:21,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:58:21,670 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:58:21,671 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-19 08:58:23,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:58:23,657 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:58:23,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-2.i [2024-11-19 08:58:23,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7496d4a3/aaca9d3b2b0e4eb692c876159b798828/FLAGc249af390 [2024-11-19 08:58:23,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7496d4a3/aaca9d3b2b0e4eb692c876159b798828 [2024-11-19 08:58:23,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:58:23,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:58:23,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:58:23,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:58:23,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:58:23,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:58:23" (1/1) ... [2024-11-19 08:58:23,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235b8b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:23, skipping insertion in model container [2024-11-19 08:58:23,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:58:23" (1/1) ... [2024-11-19 08:58:23,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:58:24,266 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 08:58:24,295 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 08:58:24,300 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 08:58:24,306 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 08:58:24,314 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 08:58:24,343 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 08:58:24,344 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 08:58:24,347 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 08:58:24,347 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 08:58:24,349 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 08:58:24,351 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 08:58:24,353 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 08:58:24,354 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 08:58:24,354 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 08:58:24,358 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 08:58:24,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:58:24,380 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 08:58:24,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:58:24,427 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 08:58:24,448 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 08:58:24,451 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 08:58:24,456 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 08:58:24,460 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 08:58:24,487 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 08:58:24,488 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 08:58:24,491 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 08:58:24,491 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 08:58:24,493 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 08:58:24,494 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 08:58:24,495 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 08:58:24,496 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 08:58:24,496 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 08:58:24,499 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 08:58:24,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:58:24,506 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:58:24,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:58:24,710 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:58:24,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24 WrapperNode [2024-11-19 08:58:24,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:58:24,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:58:24,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:58:24,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:58:24,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:24,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:24,820 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1082 [2024-11-19 08:58:24,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:58:24,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:58:24,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:58:24,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:58:24,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:24,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:24,863 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:24,942 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [220, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-19 08:58:24,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:24,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:25,003 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:25,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:25,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:25,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:25,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:58:25,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:58:25,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:58:25,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:58:25,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (1/1) ... [2024-11-19 08:58:25,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:58:25,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:58:25,097 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 08:58:25,100 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 08:58:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 08:58:25,144 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 08:58:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 08:58:25,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 08:58:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 08:58:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 08:58:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 08:58:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 08:58:25,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 08:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 08:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 08:58:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 08:58:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 08:58:25,146 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 08:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 08:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:58:25,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 08:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 08:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 08:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 08:58:25,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 08:58:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 08:58:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 08:58:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 08:58:25,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 08:58:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:58:25,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:58:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:58:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:58:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 08:58:25,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:58:25,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:58:25,385 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:58:25,387 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:58:25,413 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:58:25,454 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:58:25,476 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-19 08:58:29,259 INFO L? ?]: Removed 1101 outVars from TransFormulas that were not future-live. [2024-11-19 08:58:29,259 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:58:29,287 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:58:29,287 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 08:58:29,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:58:29 BoogieIcfgContainer [2024-11-19 08:58:29,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:58:29,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:58:29,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:58:29,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:58:29,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:58:23" (1/3) ... [2024-11-19 08:58:29,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41808182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:58:29, skipping insertion in model container [2024-11-19 08:58:29,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:58:24" (2/3) ... [2024-11-19 08:58:29,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41808182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:58:29, skipping insertion in model container [2024-11-19 08:58:29,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:58:29" (3/3) ... [2024-11-19 08:58:29,296 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-2.i [2024-11-19 08:58:29,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:58:29,315 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-19 08:58:29,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:58:29,406 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;@33df27e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:58:29,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-19 08:58:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 08:58:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:58:29,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:29,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:58:29,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:29,430 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-19 08:58:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:29,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318438047] [2024-11-19 08:58:29,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:29,443 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 08:58:29,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:29,446 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 08:58:29,448 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 08:58:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:29,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:29,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:29,677 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 08:58:29,696 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 08:58:29,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:29,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318438047] [2024-11-19 08:58:29,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318438047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:29,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:29,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:58:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479419270] [2024-11-19 08:58:29,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:29,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:29,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:29,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:29,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:29,792 INFO L87 Difference]: Start difference. First operand has 1083 states, 543 states have (on average 2.2099447513812156) internal successors, (1200), 1076 states have internal predecessors, (1200), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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 08:58:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:31,591 INFO L93 Difference]: Finished difference Result 1248 states and 1325 transitions. [2024-11-19 08:58:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:31,595 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 08:58:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:31,614 INFO L225 Difference]: With dead ends: 1248 [2024-11-19 08:58:31,614 INFO L226 Difference]: Without dead ends: 1246 [2024-11-19 08:58:31,616 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 08:58:31,619 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 983 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:31,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 816 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 08:58:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2024-11-19 08:58:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1067. [2024-11-19 08:58:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 545 states have (on average 2.0495412844036696) internal successors, (1117), 1060 states have internal predecessors, (1117), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 08:58:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1135 transitions. [2024-11-19 08:58:31,705 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1135 transitions. Word has length 3 [2024-11-19 08:58:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:31,706 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1135 transitions. [2024-11-19 08:58:31,706 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 08:58:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1135 transitions. [2024-11-19 08:58:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:58:31,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:31,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:58:31,715 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 08:58:31,910 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 08:58:31,911 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:31,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-19 08:58:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:31,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834556798] [2024-11-19 08:58:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:31,913 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 08:58:31,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:31,915 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 08:58:31,938 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 08:58:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:32,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:32,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:32,061 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 08:58:32,070 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 08:58:32,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:32,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:32,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834556798] [2024-11-19 08:58:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834556798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:32,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:32,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:58:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632697547] [2024-11-19 08:58:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:32,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:32,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:32,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:32,075 INFO L87 Difference]: Start difference. First operand 1067 states and 1135 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 08:58:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:34,118 INFO L93 Difference]: Finished difference Result 1494 states and 1605 transitions. [2024-11-19 08:58:34,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:34,119 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 08:58:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:34,124 INFO L225 Difference]: With dead ends: 1494 [2024-11-19 08:58:34,124 INFO L226 Difference]: Without dead ends: 1494 [2024-11-19 08:58:34,125 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 08:58:34,125 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 459 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:34,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1535 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 08:58:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-11-19 08:58:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1205. [2024-11-19 08:58:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 679 states have (on average 2.007363770250368) internal successors, (1363), 1198 states have internal predecessors, (1363), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:34,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1391 transitions. [2024-11-19 08:58:34,153 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1391 transitions. Word has length 3 [2024-11-19 08:58:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:34,153 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1391 transitions. [2024-11-19 08:58:34,153 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 08:58:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1391 transitions. [2024-11-19 08:58:34,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 08:58:34,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:34,154 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:34,158 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 (3)] Ended with exit code 0 [2024-11-19 08:58:34,355 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 08:58:34,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:34,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-19 08:58:34,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:34,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024093020] [2024-11-19 08:58:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:34,357 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 08:58:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:34,361 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 08:58:34,363 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 08:58:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:34,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 08:58:34,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:34,528 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 08:58:34,534 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 08:58:34,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:58:34,611 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 08:58:34,631 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 08:58:34,632 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 08:58:34,660 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 08:58:34,660 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:34,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024093020] [2024-11-19 08:58:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024093020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:34,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:34,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39358255] [2024-11-19 08:58:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:34,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:34,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:34,663 INFO L87 Difference]: Start difference. First operand 1205 states and 1391 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 08:58:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:36,760 INFO L93 Difference]: Finished difference Result 1373 states and 1567 transitions. [2024-11-19 08:58:36,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:36,761 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 08:58:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:36,766 INFO L225 Difference]: With dead ends: 1373 [2024-11-19 08:58:36,766 INFO L226 Difference]: Without dead ends: 1373 [2024-11-19 08:58:36,766 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 08:58:36,767 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 2241 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2249 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:36,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2249 Valid, 480 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-19 08:58:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-19 08:58:36,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1055. [2024-11-19 08:58:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 545 states have (on average 2.0256880733944955) internal successors, (1104), 1048 states have internal predecessors, (1104), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 08:58:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1122 transitions. [2024-11-19 08:58:36,792 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1122 transitions. Word has length 7 [2024-11-19 08:58:36,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:36,792 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1122 transitions. [2024-11-19 08:58:36,792 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 08:58:36,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1122 transitions. [2024-11-19 08:58:36,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 08:58:36,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:36,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:36,798 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 08:58:36,994 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 08:58:36,994 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:36,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:36,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-19 08:58:36,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625397721] [2024-11-19 08:58:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:36,996 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 08:58:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:36,997 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 08:58:36,998 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 08:58:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:37,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:37,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:37,120 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 08:58:37,153 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 08:58:37,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:37,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:37,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625397721] [2024-11-19 08:58:37,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625397721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:37,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:37,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:58:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923026306] [2024-11-19 08:58:37,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:37,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:37,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:37,156 INFO L87 Difference]: Start difference. First operand 1055 states and 1122 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 08:58:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:39,124 INFO L93 Difference]: Finished difference Result 1358 states and 1464 transitions. [2024-11-19 08:58:39,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:39,126 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 08:58:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:39,130 INFO L225 Difference]: With dead ends: 1358 [2024-11-19 08:58:39,131 INFO L226 Difference]: Without dead ends: 1358 [2024-11-19 08:58:39,132 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 08:58:39,133 INFO L432 NwaCegarLoop]: 1129 mSDtfsCounter, 515 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:39,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1577 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 08:58:39,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-19 08:58:39,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1082. [2024-11-19 08:58:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 582 states have (on average 2.013745704467354) internal successors, (1172), 1075 states have internal predecessors, (1172), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 08:58:39,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1190 transitions. [2024-11-19 08:58:39,163 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1190 transitions. Word has length 8 [2024-11-19 08:58:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:39,167 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1190 transitions. [2024-11-19 08:58:39,167 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 08:58:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1190 transitions. [2024-11-19 08:58:39,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 08:58:39,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:39,168 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:39,177 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 08:58:39,368 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 08:58:39,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:39,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-19 08:58:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851493796] [2024-11-19 08:58:39,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:39,371 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 08:58:39,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:39,374 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 08:58:39,375 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 08:58:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:39,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:39,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:39,499 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 08:58:39,507 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 08:58:39,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:39,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:39,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851493796] [2024-11-19 08:58:39,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851493796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:39,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:58:39,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495248285] [2024-11-19 08:58:39,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:39,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:39,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:39,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:39,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:39,509 INFO L87 Difference]: Start difference. First operand 1082 states and 1190 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 08:58:40,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:40,713 INFO L93 Difference]: Finished difference Result 1262 states and 1398 transitions. [2024-11-19 08:58:40,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:40,714 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 08:58:40,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:40,718 INFO L225 Difference]: With dead ends: 1262 [2024-11-19 08:58:40,718 INFO L226 Difference]: Without dead ends: 1262 [2024-11-19 08:58:40,718 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 08:58:40,719 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 764 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:40,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1198 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 08:58:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-19 08:58:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1035. [2024-11-19 08:58:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 582 states have (on average 1.9261168384879725) internal successors, (1121), 1028 states have internal predecessors, (1121), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 08:58:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1139 transitions. [2024-11-19 08:58:40,737 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1139 transitions. Word has length 8 [2024-11-19 08:58:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1139 transitions. [2024-11-19 08:58:40,737 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 08:58:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1139 transitions. [2024-11-19 08:58:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 08:58:40,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:40,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:40,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:40,938 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 08:58:40,938 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:40,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash -285815487, now seen corresponding path program 1 times [2024-11-19 08:58:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:40,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138326708] [2024-11-19 08:58:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:40,940 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 08:58:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:40,941 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 08:58:40,942 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 08:58:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:41,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:41,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:41,114 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 08:58:41,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:41,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:41,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138326708] [2024-11-19 08:58:41,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138326708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:41,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:41,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:41,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021630439] [2024-11-19 08:58:41,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:41,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:41,117 INFO L87 Difference]: Start difference. First operand 1035 states and 1139 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 08:58:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:41,280 INFO L93 Difference]: Finished difference Result 1490 states and 1660 transitions. [2024-11-19 08:58:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:41,281 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 08:58:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:41,284 INFO L225 Difference]: With dead ends: 1490 [2024-11-19 08:58:41,285 INFO L226 Difference]: Without dead ends: 1490 [2024-11-19 08:58:41,285 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 08:58:41,285 INFO L432 NwaCegarLoop]: 1125 mSDtfsCounter, 481 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:41,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 2098 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:58:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2024-11-19 08:58:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1222. [2024-11-19 08:58:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 764 states have (on average 1.8730366492146597) internal successors, (1431), 1215 states have internal predecessors, (1431), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:41,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1459 transitions. [2024-11-19 08:58:41,308 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1459 transitions. Word has length 11 [2024-11-19 08:58:41,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:41,308 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1459 transitions. [2024-11-19 08:58:41,309 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 08:58:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1459 transitions. [2024-11-19 08:58:41,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 08:58:41,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:41,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:41,314 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 08:58:41,510 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 08:58:41,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:41,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-19 08:58:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594667068] [2024-11-19 08:58:41,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:41,512 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 08:58:41,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:41,515 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 08:58:41,516 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 08:58:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:41,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 08:58:41,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:41,634 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 08:58:41,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:41,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:41,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594667068] [2024-11-19 08:58:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594667068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803724184] [2024-11-19 08:58:41,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:41,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:41,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:41,636 INFO L87 Difference]: Start difference. First operand 1222 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 08:58:41,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:41,669 INFO L93 Difference]: Finished difference Result 1162 states and 1373 transitions. [2024-11-19 08:58:41,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:41,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 08:58:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:41,674 INFO L225 Difference]: With dead ends: 1162 [2024-11-19 08:58:41,674 INFO L226 Difference]: Without dead ends: 1162 [2024-11-19 08:58:41,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 08:58:41,675 INFO L432 NwaCegarLoop]: 1002 mSDtfsCounter, 71 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1941 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 08:58:41,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1941 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2024-11-19 08:58:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2024-11-19 08:58:41,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 728 states have (on average 1.8475274725274726) internal successors, (1345), 1155 states have internal predecessors, (1345), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1373 transitions. [2024-11-19 08:58:41,709 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1373 transitions. Word has length 13 [2024-11-19 08:58:41,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:41,710 INFO L471 AbstractCegarLoop]: Abstraction has 1162 states and 1373 transitions. [2024-11-19 08:58:41,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 08:58:41,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1373 transitions. [2024-11-19 08:58:41,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 08:58:41,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:41,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:41,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 08:58:41,912 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 08:58:41,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr424REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:41,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2096841630, now seen corresponding path program 1 times [2024-11-19 08:58:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930768545] [2024-11-19 08:58:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:41,914 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 08:58:41,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:41,915 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 08:58:41,916 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 08:58:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:42,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:58:42,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:42,148 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 08:58:42,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:42,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930768545] [2024-11-19 08:58:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930768545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:42,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:42,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:42,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434072062] [2024-11-19 08:58:42,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:42,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:42,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:42,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:42,151 INFO L87 Difference]: Start difference. First operand 1162 states and 1373 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 08:58:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:42,562 INFO L93 Difference]: Finished difference Result 1408 states and 1576 transitions. [2024-11-19 08:58:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:42,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-19 08:58:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:42,566 INFO L225 Difference]: With dead ends: 1408 [2024-11-19 08:58:42,566 INFO L226 Difference]: Without dead ends: 1408 [2024-11-19 08:58:42,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 08:58:42,567 INFO L432 NwaCegarLoop]: 1081 mSDtfsCounter, 441 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:42,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 2986 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:58:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-19 08:58:42,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1164. [2024-11-19 08:58:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 730 states have (on average 1.8452054794520547) internal successors, (1347), 1157 states have internal predecessors, (1347), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1375 transitions. [2024-11-19 08:58:42,590 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1375 transitions. Word has length 14 [2024-11-19 08:58:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:42,590 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1375 transitions. [2024-11-19 08:58:42,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 08:58:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1375 transitions. [2024-11-19 08:58:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 08:58:42,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:42,592 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:42,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 08:58:42,792 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 08:58:42,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:42,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2096834720, now seen corresponding path program 1 times [2024-11-19 08:58:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:42,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405001336] [2024-11-19 08:58:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:42,794 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 08:58:42,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:42,795 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 08:58:42,796 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 08:58:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:42,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:58:42,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:42,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:42,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:42,935 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 08:58:42,939 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 08:58:42,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:58:42,988 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 08:58:43,001 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 08:58:43,001 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:43,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:43,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405001336] [2024-11-19 08:58:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405001336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805603517] [2024-11-19 08:58:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:43,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:43,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:43,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:43,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:43,004 INFO L87 Difference]: Start difference. First operand 1164 states and 1375 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 08:58:43,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:43,334 INFO L93 Difference]: Finished difference Result 1994 states and 2228 transitions. [2024-11-19 08:58:43,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:43,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-19 08:58:43,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:43,342 INFO L225 Difference]: With dead ends: 1994 [2024-11-19 08:58:43,343 INFO L226 Difference]: Without dead ends: 1994 [2024-11-19 08:58:43,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 08:58:43,344 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 934 mSDsluCounter, 2181 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 3387 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:43,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 3387 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 08:58:43,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2024-11-19 08:58:43,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1163. [2024-11-19 08:58:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 729 states have (on average 1.8449931412894376) internal successors, (1345), 1156 states have internal predecessors, (1345), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1373 transitions. [2024-11-19 08:58:43,372 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1373 transitions. Word has length 14 [2024-11-19 08:58:43,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:43,373 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1373 transitions. [2024-11-19 08:58:43,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 08:58:43,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1373 transitions. [2024-11-19 08:58:43,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-19 08:58:43,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:43,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:43,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:43,574 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 08:58:43,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:43,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:43,576 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-19 08:58:43,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:43,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91823730] [2024-11-19 08:58:43,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:43,576 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 08:58:43,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:43,579 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 08:58:43,581 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 08:58:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:43,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 08:58:43,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:43,759 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 08:58:43,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:43,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:43,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91823730] [2024-11-19 08:58:43,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91823730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:43,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:43,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146581587] [2024-11-19 08:58:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:43,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:58:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:58:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:58:43,760 INFO L87 Difference]: Start difference. First operand 1163 states and 1373 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 08:58:43,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:43,781 INFO L93 Difference]: Finished difference Result 1103 states and 1287 transitions. [2024-11-19 08:58:43,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:58:43,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-19 08:58:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:43,784 INFO L225 Difference]: With dead ends: 1103 [2024-11-19 08:58:43,784 INFO L226 Difference]: Without dead ends: 1103 [2024-11-19 08:58:43,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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 08:58:43,784 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 71 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1855 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 08:58:43,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1855 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2024-11-19 08:58:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1103. [2024-11-19 08:58:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 693 states have (on average 1.8167388167388168) internal successors, (1259), 1096 states have internal predecessors, (1259), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1287 transitions. [2024-11-19 08:58:43,801 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1287 transitions. Word has length 18 [2024-11-19 08:58:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1287 transitions. [2024-11-19 08:58:43,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 08:58:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1287 transitions. [2024-11-19 08:58:43,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-19 08:58:43,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:43,804 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 08:58:43,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 08:58:44,004 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 08:58:44,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:44,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:44,006 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-19 08:58:44,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:44,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613344508] [2024-11-19 08:58:44,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:44,007 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 08:58:44,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:44,010 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 08:58:44,011 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 08:58:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:44,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:44,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:44,180 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 08:58:44,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:44,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:44,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613344508] [2024-11-19 08:58:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [613344508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:44,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610683750] [2024-11-19 08:58:44,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:44,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:44,183 INFO L87 Difference]: Start difference. First operand 1103 states and 1287 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 08:58:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:44,250 INFO L93 Difference]: Finished difference Result 1073 states and 1229 transitions. [2024-11-19 08:58:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:44,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 08:58:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:44,254 INFO L225 Difference]: With dead ends: 1073 [2024-11-19 08:58:44,254 INFO L226 Difference]: Without dead ends: 1073 [2024-11-19 08:58:44,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 08:58:44,255 INFO L432 NwaCegarLoop]: 914 mSDtfsCounter, 48 mSDsluCounter, 1802 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2716 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 08:58:44,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2716 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-19 08:58:44,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2024-11-19 08:58:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 677 states have (on average 1.7740029542097489) internal successors, (1201), 1066 states have internal predecessors, (1201), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1229 transitions. [2024-11-19 08:58:44,274 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1229 transitions. Word has length 20 [2024-11-19 08:58:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:44,274 INFO L471 AbstractCegarLoop]: Abstraction has 1073 states and 1229 transitions. [2024-11-19 08:58:44,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 08:58:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1229 transitions. [2024-11-19 08:58:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 08:58:44,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:44,276 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] [2024-11-19 08:58:44,282 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 08:58:44,476 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 08:58:44,477 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:44,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:44,477 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-19 08:58:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:44,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586357302] [2024-11-19 08:58:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:44,478 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 08:58:44,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:44,481 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 08:58:44,482 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 08:58:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:44,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:44,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:44,649 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 08:58:44,719 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 08:58:44,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:44,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586357302] [2024-11-19 08:58:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586357302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:44,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:44,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614458658] [2024-11-19 08:58:44,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:44,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:44,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:44,722 INFO L87 Difference]: Start difference. First operand 1073 states and 1229 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 08:58:45,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:45,820 INFO L93 Difference]: Finished difference Result 1077 states and 1229 transitions. [2024-11-19 08:58:45,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:45,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 08:58:45,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:45,823 INFO L225 Difference]: With dead ends: 1077 [2024-11-19 08:58:45,823 INFO L226 Difference]: Without dead ends: 1077 [2024-11-19 08:58:45,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 08:58:45,824 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 654 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:45,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1154 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 08:58:45,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2024-11-19 08:58:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1069. [2024-11-19 08:58:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 677 states have (on average 1.7621861152141802) internal successors, (1193), 1062 states have internal predecessors, (1193), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1221 transitions. [2024-11-19 08:58:45,837 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1221 transitions. Word has length 34 [2024-11-19 08:58:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1221 transitions. [2024-11-19 08:58:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 08:58:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1221 transitions. [2024-11-19 08:58:45,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 08:58:45,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:45,839 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] [2024-11-19 08:58:45,846 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 08:58:46,043 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 08:58:46,044 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:46,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-19 08:58:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2067078322] [2024-11-19 08:58:46,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:46,045 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 08:58:46,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:46,048 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 08:58:46,049 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 08:58:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:46,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 08:58:46,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:46,232 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 08:58:46,393 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 08:58:46,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:46,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:46,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2067078322] [2024-11-19 08:58:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2067078322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:46,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634999554] [2024-11-19 08:58:46,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:46,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:46,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:46,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:46,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:46,397 INFO L87 Difference]: Start difference. First operand 1069 states and 1221 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 08:58:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:48,334 INFO L93 Difference]: Finished difference Result 1388 states and 1582 transitions. [2024-11-19 08:58:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:48,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 34 [2024-11-19 08:58:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:48,338 INFO L225 Difference]: With dead ends: 1388 [2024-11-19 08:58:48,339 INFO L226 Difference]: Without dead ends: 1388 [2024-11-19 08:58:48,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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 08:58:48,339 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 401 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:48,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 2157 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 08:58:48,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-19 08:58:48,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1065. [2024-11-19 08:58:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 677 states have (on average 1.7503692762186116) internal successors, (1185), 1058 states have internal predecessors, (1185), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:48,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1213 transitions. [2024-11-19 08:58:48,355 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1213 transitions. Word has length 34 [2024-11-19 08:58:48,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:48,356 INFO L471 AbstractCegarLoop]: Abstraction has 1065 states and 1213 transitions. [2024-11-19 08:58:48,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 08:58:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1213 transitions. [2024-11-19 08:58:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 08:58:48,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:48,358 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] [2024-11-19 08:58:48,367 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 08:58:48,559 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 08:58:48,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:48,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:48,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-19 08:58:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011094909] [2024-11-19 08:58:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:48,561 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 08:58:48,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:48,565 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 08:58:48,566 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 08:58:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:48,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:48,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:48,838 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 08:58:48,838 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:48,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011094909] [2024-11-19 08:58:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011094909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:48,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:48,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:48,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985734637] [2024-11-19 08:58:48,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:48,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:48,840 INFO L87 Difference]: Start difference. First operand 1065 states and 1213 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 08:58:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:48,887 INFO L93 Difference]: Finished difference Result 1053 states and 1193 transitions. [2024-11-19 08:58:48,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:58:48,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2024-11-19 08:58:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:48,890 INFO L225 Difference]: With dead ends: 1053 [2024-11-19 08:58:48,890 INFO L226 Difference]: Without dead ends: 1053 [2024-11-19 08:58:48,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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 08:58:48,891 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 21 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2693 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 08:58:48,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2693 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-19 08:58:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1053. [2024-11-19 08:58:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 665 states have (on average 1.7518796992481203) internal successors, (1165), 1046 states have internal predecessors, (1165), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1193 transitions. [2024-11-19 08:58:48,906 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1193 transitions. Word has length 53 [2024-11-19 08:58:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:48,906 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1193 transitions. [2024-11-19 08:58:48,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 08:58:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1193 transitions. [2024-11-19 08:58:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 08:58:48,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:48,907 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] [2024-11-19 08:58:48,915 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 08:58:49,108 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 08:58:49,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:49,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-19 08:58:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625522946] [2024-11-19 08:58:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:49,109 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 08:58:49,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:49,111 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 08:58:49,112 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 08:58:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:49,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 08:58:49,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:49,427 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 08:58:49,435 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 08:58:49,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:58:49,919 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 08:58:49,932 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 08:58:49,932 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 08:58:49,945 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 08:58:49,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:49,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:49,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625522946] [2024-11-19 08:58:49,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625522946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:49,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:49,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:58:49,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912410615] [2024-11-19 08:58:49,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:49,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:49,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:49,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:49,949 INFO L87 Difference]: Start difference. First operand 1053 states and 1193 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 08:58:51,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:51,212 INFO L93 Difference]: Finished difference Result 1015 states and 1155 transitions. [2024-11-19 08:58:51,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2024-11-19 08:58:51,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:51,216 INFO L225 Difference]: With dead ends: 1015 [2024-11-19 08:58:51,216 INFO L226 Difference]: Without dead ends: 1015 [2024-11-19 08:58:51,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 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 08:58:51,217 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1160 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:51,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 597 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 08:58:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-19 08:58:51,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 978. [2024-11-19 08:58:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 628 states have (on average 1.6767515923566878) internal successors, (1053), 971 states have internal predecessors, (1053), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1081 transitions. [2024-11-19 08:58:51,232 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1081 transitions. Word has length 61 [2024-11-19 08:58:51,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:51,233 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1081 transitions. [2024-11-19 08:58:51,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 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 08:58:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1081 transitions. [2024-11-19 08:58:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 08:58:51,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:51,234 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] [2024-11-19 08:58:51,245 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 08:58:51,435 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 08:58:51,435 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:51,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:51,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-19 08:58:51,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:51,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913078916] [2024-11-19 08:58:51,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:51,436 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 08:58:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:51,437 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 08:58:51,438 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 08:58:51,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:51,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 08:58:51,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:51,675 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 08:58:51,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:58:51,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 08:58:51,709 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 08:58:51,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:51,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:51,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913078916] [2024-11-19 08:58:51,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913078916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:51,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:51,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:51,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611820201] [2024-11-19 08:58:51,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:51,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:58:51,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:51,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:58:51,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:58:51,711 INFO L87 Difference]: Start difference. First operand 978 states and 1081 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 08:58:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:53,103 INFO L93 Difference]: Finished difference Result 977 states and 1080 transitions. [2024-11-19 08:58:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:53,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-19 08:58:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:53,106 INFO L225 Difference]: With dead ends: 977 [2024-11-19 08:58:53,106 INFO L226 Difference]: Without dead ends: 977 [2024-11-19 08:58:53,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:58:53,107 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 2 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:53,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2313 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 08:58:53,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-19 08:58:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2024-11-19 08:58:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 628 states have (on average 1.6751592356687899) internal successors, (1052), 970 states have internal predecessors, (1052), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1080 transitions. [2024-11-19 08:58:53,119 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1080 transitions. Word has length 66 [2024-11-19 08:58:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:53,120 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1080 transitions. [2024-11-19 08:58:53,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 08:58:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1080 transitions. [2024-11-19 08:58:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 08:58:53,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:53,121 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] [2024-11-19 08:58:53,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:53,321 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 08:58:53,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:53,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:53,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-19 08:58:53,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:53,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441708739] [2024-11-19 08:58:53,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:53,323 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 08:58:53,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:53,326 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 08:58:53,327 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 08:58:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:53,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 08:58:53,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:53,643 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 08:58:53,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 08:58:53,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:58:53,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 08:58:53,729 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 08:58:53,730 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:53,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441708739] [2024-11-19 08:58:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441708739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487620644] [2024-11-19 08:58:53,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:53,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:58:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:58:53,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:58:53,731 INFO L87 Difference]: Start difference. First operand 977 states and 1080 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 08:58:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:55,368 INFO L93 Difference]: Finished difference Result 976 states and 1079 transitions. [2024-11-19 08:58:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:58:55,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 66 [2024-11-19 08:58:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:55,372 INFO L225 Difference]: With dead ends: 976 [2024-11-19 08:58:55,372 INFO L226 Difference]: Without dead ends: 976 [2024-11-19 08:58:55,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:58:55,373 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 1 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:55,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2346 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 08:58:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-19 08:58:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-11-19 08:58:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 627 states have (on average 1.6762360446570972) internal successors, (1051), 969 states have internal predecessors, (1051), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 08:58:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1079 transitions. [2024-11-19 08:58:55,384 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1079 transitions. Word has length 66 [2024-11-19 08:58:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:55,385 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1079 transitions. [2024-11-19 08:58:55,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 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 08:58:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1079 transitions. [2024-11-19 08:58:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 08:58:55,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:55,386 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, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:55,397 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 08:58:55,590 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 08:58:55,591 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:55,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1185864454, now seen corresponding path program 1 times [2024-11-19 08:58:55,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:55,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129880414] [2024-11-19 08:58:55,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:55,592 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 08:58:55,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:55,593 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 08:58:55,594 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 08:58:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:55,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:58:55,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:55,860 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 08:58:55,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:58:55,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129880414] [2024-11-19 08:58:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129880414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:58:55,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:58:55,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:58:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110823272] [2024-11-19 08:58:55,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:58:55,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:58:55,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:55,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:58:55,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:55,863 INFO L87 Difference]: Start difference. First operand 976 states and 1079 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:58:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:55,905 INFO L93 Difference]: Finished difference Result 979 states and 1083 transitions. [2024-11-19 08:58:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:58:55,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2024-11-19 08:58:55,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:55,910 INFO L225 Difference]: With dead ends: 979 [2024-11-19 08:58:55,910 INFO L226 Difference]: Without dead ends: 979 [2024-11-19 08:58:55,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:58:55,911 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 0 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:55,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2638 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:58:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-11-19 08:58:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 979. [2024-11-19 08:58:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 629 states have (on average 1.6756756756756757) internal successors, (1054), 972 states have internal predecessors, (1054), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1083 transitions. [2024-11-19 08:58:55,928 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1083 transitions. Word has length 74 [2024-11-19 08:58:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:55,928 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1083 transitions. [2024-11-19 08:58:55,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:58:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1083 transitions. [2024-11-19 08:58:55,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 08:58:55,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:55,930 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:55,938 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 08:58:56,130 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 08:58:56,131 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:56,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash -939299591, now seen corresponding path program 1 times [2024-11-19 08:58:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:56,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60033062] [2024-11-19 08:58:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:58:56,132 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 08:58:56,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:56,135 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 08:58:56,136 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 08:58:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:58:56,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:58:56,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:56,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:56,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:56,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60033062] [2024-11-19 08:58:56,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60033062] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:56,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:56,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 08:58:56,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938474616] [2024-11-19 08:58:56,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:56,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 08:58:56,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:56,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 08:58:56,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 08:58:56,471 INFO L87 Difference]: Start difference. First operand 979 states and 1083 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:56,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:56,601 INFO L93 Difference]: Finished difference Result 991 states and 1100 transitions. [2024-11-19 08:58:56,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:58:56,602 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 75 [2024-11-19 08:58:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:56,607 INFO L225 Difference]: With dead ends: 991 [2024-11-19 08:58:56,608 INFO L226 Difference]: Without dead ends: 991 [2024-11-19 08:58:56,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:58:56,609 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 5 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:56,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3515 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:58:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-19 08:58:56,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 989. [2024-11-19 08:58:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 638 states have (on average 1.6755485893416928) internal successors, (1069), 981 states have internal predecessors, (1069), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1098 transitions. [2024-11-19 08:58:56,627 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1098 transitions. Word has length 75 [2024-11-19 08:58:56,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:56,627 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1098 transitions. [2024-11-19 08:58:56,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1098 transitions. [2024-11-19 08:58:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 08:58:56,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:56,628 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:56,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 08:58:56,829 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 08:58:56,829 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:56,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:56,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1077755846, now seen corresponding path program 2 times [2024-11-19 08:58:56,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:56,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924857323] [2024-11-19 08:58:56,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:58:56,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 08:58:56,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:56,832 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 08:58:56,832 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 08:58:57,316 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 08:58:57,316 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:58:57,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 08:58:57,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:57,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:57,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:57,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924857323] [2024-11-19 08:58:57,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924857323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:57,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:57,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 08:58:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577365062] [2024-11-19 08:58:57,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:57,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:58:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:58:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 08:58:57,478 INFO L87 Difference]: Start difference. First operand 989 states and 1098 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:58:57,805 INFO L93 Difference]: Finished difference Result 1004 states and 1120 transitions. [2024-11-19 08:58:57,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 08:58:57,806 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2024-11-19 08:58:57,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:58:57,809 INFO L225 Difference]: With dead ends: 1004 [2024-11-19 08:58:57,809 INFO L226 Difference]: Without dead ends: 1000 [2024-11-19 08:58:57,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 08:58:57,810 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 13 mSDsluCounter, 7896 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8777 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:58:57,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8777 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:58:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-11-19 08:58:57,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 998. [2024-11-19 08:58:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 647 states have (on average 1.6707882534775889) internal successors, (1081), 990 states have internal predecessors, (1081), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:58:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1110 transitions. [2024-11-19 08:58:57,825 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1110 transitions. Word has length 78 [2024-11-19 08:58:57,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:58:57,825 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1110 transitions. [2024-11-19 08:58:57,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:58:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1110 transitions. [2024-11-19 08:58:57,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 08:58:57,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:58:57,827 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:58:57,839 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 08:58:58,027 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 08:58:58,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:58:58,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:58:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash -207019290, now seen corresponding path program 3 times [2024-11-19 08:58:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:58:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273530225] [2024-11-19 08:58:58,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 08:58:58,028 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 08:58:58,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:58:58,030 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 08:58:58,031 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 08:58:58,620 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 08:58:58,621 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:58:58,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 08:58:58,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:58:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:58,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:58:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:58:59,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:58:59,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273530225] [2024-11-19 08:58:59,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273530225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:58:59,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:58:59,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 08:58:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392154314] [2024-11-19 08:58:59,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:58:59,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 08:58:59,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:58:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 08:58:59,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 08:58:59,171 INFO L87 Difference]: Start difference. First operand 998 states and 1110 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:59:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:00,539 INFO L93 Difference]: Finished difference Result 1022 states and 1149 transitions. [2024-11-19 08:59:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 08:59:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 84 [2024-11-19 08:59:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:00,543 INFO L225 Difference]: With dead ends: 1022 [2024-11-19 08:59:00,544 INFO L226 Difference]: Without dead ends: 1016 [2024-11-19 08:59:00,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 08:59:00,545 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 21 mSDsluCounter, 11423 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12305 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:00,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12305 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:59:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2024-11-19 08:59:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 1016. [2024-11-19 08:59:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 665 states have (on average 1.6601503759398497) internal successors, (1104), 1008 states have internal predecessors, (1104), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:59:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1133 transitions. [2024-11-19 08:59:00,559 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1133 transitions. Word has length 84 [2024-11-19 08:59:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:00,559 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1133 transitions. [2024-11-19 08:59:00,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 26 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:59:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1133 transitions. [2024-11-19 08:59:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 08:59:00,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:00,561 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:59:00,572 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 08:59:00,761 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 08:59:00,762 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:59:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash -667524826, now seen corresponding path program 4 times [2024-11-19 08:59:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:59:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276381552] [2024-11-19 08:59:00,763 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 08:59:00,763 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 08:59:00,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:59:00,764 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 08:59:00,765 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 08:59:01,193 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 08:59:01,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:59:01,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 08:59:01,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:59:01,527 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:59:02,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:59:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276381552] [2024-11-19 08:59:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276381552] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:59:02,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:59:02,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 08:59:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902036041] [2024-11-19 08:59:02,634 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:59:02,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 08:59:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:59:02,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 08:59:02,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 08:59:02,637 INFO L87 Difference]: Start difference. First operand 1016 states and 1133 transitions. Second operand has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:59:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:59:06,973 INFO L93 Difference]: Finished difference Result 1056 states and 1205 transitions. [2024-11-19 08:59:06,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 08:59:06,974 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-19 08:59:06,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:59:06,978 INFO L225 Difference]: With dead ends: 1056 [2024-11-19 08:59:06,978 INFO L226 Difference]: Without dead ends: 1052 [2024-11-19 08:59:06,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 08:59:06,981 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 37 mSDsluCounter, 20197 mSDsCounter, 0 mSdLazyCounter, 1931 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 21078 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:59:06,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 21078 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1931 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 08:59:06,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-19 08:59:06,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1050. [2024-11-19 08:59:06,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 699 states have (on average 1.6452074391988556) internal successors, (1150), 1042 states have internal predecessors, (1150), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 08:59:06,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1179 transitions. [2024-11-19 08:59:06,995 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1179 transitions. Word has length 96 [2024-11-19 08:59:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:59:06,995 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1179 transitions. [2024-11-19 08:59:06,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.38) internal successors, (119), 50 states have internal predecessors, (119), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:59:06,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1179 transitions. [2024-11-19 08:59:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 08:59:06,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:59:06,997 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:59:07,011 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 08:59:07,197 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 08:59:07,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-19 08:59:07,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:59:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1226272954, now seen corresponding path program 5 times [2024-11-19 08:59:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:59:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039822110] [2024-11-19 08:59:07,198 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 08:59:07,198 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 08:59:07,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:59:07,200 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 08:59:07,201 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 08:59:08,347 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-19 08:59:08,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:59:08,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-19 08:59:08,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:59:08,384 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 08:59:08,476 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 08:59:08,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 08:59:08,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 08:59:08,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-19 08:59:09,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 08:59:09,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 08:59:09,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 08:59:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-19 08:59:09,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:59:09,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:59:09,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039822110] [2024-11-19 08:59:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039822110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:59:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [172489911] [2024-11-19 08:59:09,840 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 08:59:09,840 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 08:59:09,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 08:59:09,843 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 08:59:09,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process