./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:57:58,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:57:58,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 20:57:58,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:57:58,975 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:57:59,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:57:59,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:57:59,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:57:59,007 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:57:59,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:57:59,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:57:59,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:57:59,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:57:59,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:57:59,009 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:57:59,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:57:59,012 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:57:59,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:57:59,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:57:59,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:57:59,013 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:57:59,015 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:57:59,015 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:57:59,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:57:59,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:57:59,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:57:59,017 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:57:59,017 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:57:59,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:57:59,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:57:59,018 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:57:59,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:57:59,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:57:59,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:57:59,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:57:59,020 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:57:59,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 20:57:59,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 20:57:59,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:57:59,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:57:59,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:57:59,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:57:59,022 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-22 20:57:59,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:57:59,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:57:59,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:57:59,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:57:59,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:57:59,298 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_test9-2.i [2024-11-22 20:58:00,768 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:58:01,133 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:58:01,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-22 20:58:01,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6483e7ec9/6fabc190e58f4fa7971093f313313fe2/FLAG63672e631 [2024-11-22 20:58:01,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6483e7ec9/6fabc190e58f4fa7971093f313313fe2 [2024-11-22 20:58:01,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:58:01,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:58:01,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:58:01,177 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:58:01,182 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:58:01,183 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:01" (1/1) ... [2024-11-22 20:58:01,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fb3f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:01, skipping insertion in model container [2024-11-22 20:58:01,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:01" (1/1) ... [2024-11-22 20:58:01,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:58:02,075 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-22 20:58:02,095 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-22 20:58:02,101 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,107 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,119 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,138 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,139 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,141 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-22 20:58:02,141 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-22 20:58:02,143 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-22 20:58:02,145 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-22 20:58:02,146 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-22 20:58:02,147 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-22 20:58:02,148 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,151 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:02,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:58:02,172 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-22 20:58:02,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@690d46d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:02, skipping insertion in model container [2024-11-22 20:58:02,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:58:02,174 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-22 20:58:02,176 INFO L158 Benchmark]: Toolchain (without parser) took 1000.95ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 75.3MB in the beginning and 159.9MB in the end (delta: -84.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-22 20:58:02,177 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 96.6MB in the beginning and 96.4MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 20:58:02,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 997.65ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 75.3MB in the beginning and 159.9MB in the end (delta: -84.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-22 20:58:02,180 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.20ms. Allocated memory is still 134.2MB. Free memory was 96.6MB in the beginning and 96.4MB in the end (delta: 176.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 997.65ms. Allocated memory was 134.2MB in the beginning and 203.4MB in the end (delta: 69.2MB). Free memory was 75.3MB in the beginning and 159.9MB in the end (delta: -84.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-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 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:58:04,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:58:04,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 20:58:04,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:58:04,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:58:04,500 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:58:04,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:58:04,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:58:04,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:58:04,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:58:04,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:58:04,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:58:04,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:58:04,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:58:04,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:58:04,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:58:04,508 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:58:04,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:58:04,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:58:04,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:58:04,515 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:58:04,515 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:58:04,515 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:58:04,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:58:04,516 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:58:04,516 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 20:58:04,516 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:58:04,517 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 20:58:04,517 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:58:04,517 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:58:04,517 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:58:04,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:58:04,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:58:04,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:58:04,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:58:04,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:58:04,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:58:04,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:58:04,521 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 20:58:04,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 20:58:04,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:58:04,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:58:04,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:58:04,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:58:04,523 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 -> 50ec0e1b32f61b9ee697cf2c7598d178ee7b7b08e68108a0f594c4a6a80ab80c [2024-11-22 20:58:04,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:58:04,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:58:04,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:58:04,930 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:58:04,931 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:58:04,933 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_test9-2.i [2024-11-22 20:58:06,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:58:06,964 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:58:06,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test9-2.i [2024-11-22 20:58:06,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928f2ffb/24842e17f8bb4c8c8c181977c264d805/FLAG32b8ed863 [2024-11-22 20:58:07,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928f2ffb/24842e17f8bb4c8c8c181977c264d805 [2024-11-22 20:58:07,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:58:07,003 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:58:07,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:58:07,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:58:07,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:58:07,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:07" (1/1) ... [2024-11-22 20:58:07,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fca74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:07, skipping insertion in model container [2024-11-22 20:58:07,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:07" (1/1) ... [2024-11-22 20:58:07,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:58:07,770 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-22 20:58:07,786 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-22 20:58:07,789 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-22 20:58:07,796 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-22 20:58:07,807 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-22 20:58:07,834 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-22 20:58:07,834 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-22 20:58:07,836 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-22 20:58:07,837 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-22 20:58:07,839 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-22 20:58:07,840 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-22 20:58:07,842 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-22 20:58:07,843 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-22 20:58:07,844 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-22 20:58:07,850 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-22 20:58:07,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:58:07,892 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-22 20:58:07,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:58:08,005 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-22 20:58:08,021 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-22 20:58:08,025 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-22 20:58:08,028 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-22 20:58:08,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:08,066 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-22 20:58:08,068 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-22 20:58:08,070 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-22 20:58:08,071 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-22 20:58:08,073 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-22 20:58:08,076 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-22 20:58:08,077 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 20:58:08,078 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-22 20:58:08,078 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-22 20:58:08,081 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-22 20:58:08,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:58:08,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 20:58:08,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:58:08,266 INFO L204 MainTranslator]: Completed translation [2024-11-22 20:58:08,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08 WrapperNode [2024-11-22 20:58:08,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:58:08,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 20:58:08,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 20:58:08,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 20:58:08,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,452 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3062 [2024-11-22 20:58:08,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 20:58:08,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 20:58:08,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 20:58:08,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 20:58:08,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,484 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,572 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-22 20:58:08,572 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,699 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 20:58:08,738 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 20:58:08,738 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 20:58:08,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 20:58:08,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (1/1) ... [2024-11-22 20:58:08,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:58:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:58:08,778 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-22 20:58:08,781 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-22 20:58:08,829 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-22 20:58:08,829 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-22 20:58:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 20:58:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 20:58:08,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-22 20:58:08,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 20:58:08,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-22 20:58:08,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 20:58:08,831 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 20:58:08,832 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 20:58:08,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-22 20:58:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 20:58:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 20:58:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-22 20:58:08,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 20:58:08,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 20:58:09,080 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 20:58:09,082 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 20:58:09,107 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:58:09,177 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:58:09,203 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:58:14,347 INFO L? ?]: Removed 1596 outVars from TransFormulas that were not future-live. [2024-11-22 20:58:14,347 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 20:58:14,407 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 20:58:14,408 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-22 20:58:14,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:14 BoogieIcfgContainer [2024-11-22 20:58:14,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 20:58:14,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 20:58:14,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 20:58:14,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 20:58:14,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:58:07" (1/3) ... [2024-11-22 20:58:14,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b5ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:58:14, skipping insertion in model container [2024-11-22 20:58:14,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:08" (2/3) ... [2024-11-22 20:58:14,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f5b5ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:58:14, skipping insertion in model container [2024-11-22 20:58:14,419 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:14" (3/3) ... [2024-11-22 20:58:14,420 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test9-2.i [2024-11-22 20:58:14,438 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 20:58:14,438 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-22 20:58:14,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 20:58:14,566 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;@740f278f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 20:58:14,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-22 20:58:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-22 20:58:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 20:58:14,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:14,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 20:58:14,592 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-22 20:58:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:14,599 INFO L85 PathProgramCache]: Analyzing trace with hash 65605, now seen corresponding path program 1 times [2024-11-22 20:58:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957836031] [2024-11-22 20:58:14,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:14,612 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-22 20:58:14,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:14,615 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-22 20:58:14,617 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-22 20:58:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:14,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:58:14,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:14,824 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-22 20:58:14,837 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-22 20:58:14,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:14,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:14,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957836031] [2024-11-22 20:58:14,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957836031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:14,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:14,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:14,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023801642] [2024-11-22 20:58:14,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:14,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:14,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:14,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:14,880 INFO L87 Difference]: Start difference. First operand has 2073 states, 1038 states have (on average 2.1098265895953756) internal successors, (2190), 2066 states have internal predecessors, (2190), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) 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-22 20:58:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:17,204 INFO L93 Difference]: Finished difference Result 2238 states and 3305 transitions. [2024-11-22 20:58:17,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:17,206 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-22 20:58:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:17,235 INFO L225 Difference]: With dead ends: 2238 [2024-11-22 20:58:17,235 INFO L226 Difference]: Without dead ends: 2236 [2024-11-22 20:58:17,237 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-22 20:58:17,240 INFO L432 NwaCegarLoop]: 2640 mSDtfsCounter, 1973 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 1140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2476 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:17,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2476 Valid, 2796 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1140 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-22 20:58:17,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2236 states. [2024-11-22 20:58:17,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2236 to 2057. [2024-11-22 20:58:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 1040 states have (on average 2.0259615384615386) internal successors, (2107), 2050 states have internal predecessors, (2107), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-22 20:58:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 3115 transitions. [2024-11-22 20:58:17,626 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 3115 transitions. Word has length 3 [2024-11-22 20:58:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:17,626 INFO L471 AbstractCegarLoop]: Abstraction has 2057 states and 3115 transitions. [2024-11-22 20:58:17,627 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-22 20:58:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 3115 transitions. [2024-11-22 20:58:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 20:58:17,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:17,628 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 20:58:17,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 20:58:17,828 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-22 20:58:17,830 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-22 20:58:17,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:17,831 INFO L85 PathProgramCache]: Analyzing trace with hash 65606, now seen corresponding path program 1 times [2024-11-22 20:58:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:17,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455004551] [2024-11-22 20:58:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:17,832 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-22 20:58:17,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:17,835 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-22 20:58:17,837 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-22 20:58:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:17,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:58:17,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:17,970 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-22 20:58:17,980 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-22 20:58:17,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:17,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:17,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455004551] [2024-11-22 20:58:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455004551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:17,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850471615] [2024-11-22 20:58:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:17,984 INFO L87 Difference]: Start difference. First operand 2057 states and 3115 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-22 20:58:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:20,883 INFO L93 Difference]: Finished difference Result 3474 states and 5565 transitions. [2024-11-22 20:58:20,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:20,883 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-22 20:58:20,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:20,902 INFO L225 Difference]: With dead ends: 3474 [2024-11-22 20:58:20,903 INFO L226 Difference]: Without dead ends: 3474 [2024-11-22 20:58:20,903 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-22 20:58:20,905 INFO L432 NwaCegarLoop]: 3017 mSDtfsCounter, 1449 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 5104 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:20,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 5104 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-22 20:58:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2024-11-22 20:58:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3185. [2024-11-22 20:58:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3185 states, 1669 states have (on average 2.0029958058717794) internal successors, (3343), 3178 states have internal predecessors, (3343), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3185 states to 3185 states and 5351 transitions. [2024-11-22 20:58:21,248 INFO L78 Accepts]: Start accepts. Automaton has 3185 states and 5351 transitions. Word has length 3 [2024-11-22 20:58:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:21,248 INFO L471 AbstractCegarLoop]: Abstraction has 3185 states and 5351 transitions. [2024-11-22 20:58:21,248 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-22 20:58:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 3185 states and 5351 transitions. [2024-11-22 20:58:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 20:58:21,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:21,250 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:21,255 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-22 20:58:21,451 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-22 20:58:21,452 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-22 20:58:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash 458521935, now seen corresponding path program 1 times [2024-11-22 20:58:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126044694] [2024-11-22 20:58:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:21,454 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-22 20:58:21,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:21,462 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-22 20:58:21,469 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-22 20:58:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:21,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:58:21,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:21,615 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-22 20:58:21,623 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-22 20:58:21,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:58:21,687 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-22 20:58:21,701 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:58:21,701 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-22 20:58:21,725 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-22 20:58:21,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:21,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:21,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126044694] [2024-11-22 20:58:21,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126044694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:21,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:21,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:21,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101577803] [2024-11-22 20:58:21,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:21,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:21,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:21,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:21,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:21,728 INFO L87 Difference]: Start difference. First operand 3185 states and 5351 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-22 20:58:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:25,075 INFO L93 Difference]: Finished difference Result 3353 states and 5527 transitions. [2024-11-22 20:58:25,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:25,076 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-22 20:58:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:25,094 INFO L225 Difference]: With dead ends: 3353 [2024-11-22 20:58:25,095 INFO L226 Difference]: Without dead ends: 3353 [2024-11-22 20:58:25,095 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-22 20:58:25,096 INFO L432 NwaCegarLoop]: 2371 mSDtfsCounter, 2257 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2760 SdHoareTripleChecker+Valid, 2471 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:25,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2760 Valid, 2471 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-22 20:58:25,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3353 states. [2024-11-22 20:58:25,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3353 to 2045. [2024-11-22 20:58:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2045 states, 1040 states have (on average 2.0134615384615384) internal successors, (2094), 2038 states have internal predecessors, (2094), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-22 20:58:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 3102 transitions. [2024-11-22 20:58:25,358 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 3102 transitions. Word has length 7 [2024-11-22 20:58:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:25,360 INFO L471 AbstractCegarLoop]: Abstraction has 2045 states and 3102 transitions. [2024-11-22 20:58:25,361 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-22 20:58:25,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 3102 transitions. [2024-11-22 20:58:25,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 20:58:25,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:25,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:25,368 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-22 20:58:25,562 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-22 20:58:25,562 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-22 20:58:25,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:25,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278099, now seen corresponding path program 1 times [2024-11-22 20:58:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:25,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227654971] [2024-11-22 20:58:25,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:25,564 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-22 20:58:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:25,566 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-22 20:58:25,567 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-22 20:58:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:25,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:58:25,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:25,705 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-22 20:58:25,742 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-22 20:58:25,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:25,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:25,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227654971] [2024-11-22 20:58:25,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227654971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:25,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:25,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:25,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447371583] [2024-11-22 20:58:25,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:25,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:25,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:25,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:25,746 INFO L87 Difference]: Start difference. First operand 2045 states and 3102 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-22 20:58:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:28,621 INFO L93 Difference]: Finished difference Result 3338 states and 5424 transitions. [2024-11-22 20:58:28,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:28,622 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-22 20:58:28,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:28,636 INFO L225 Difference]: With dead ends: 3338 [2024-11-22 20:58:28,637 INFO L226 Difference]: Without dead ends: 3338 [2024-11-22 20:58:28,637 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-22 20:58:28,638 INFO L432 NwaCegarLoop]: 4987 mSDtfsCounter, 1505 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 7415 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:28,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 7415 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-22 20:58:28,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2024-11-22 20:58:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2072. [2024-11-22 20:58:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1077 states have (on average 2.007428040854225) internal successors, (2162), 2065 states have internal predecessors, (2162), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-22 20:58:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 3170 transitions. [2024-11-22 20:58:28,887 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 3170 transitions. Word has length 8 [2024-11-22 20:58:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:28,888 INFO L471 AbstractCegarLoop]: Abstraction has 2072 states and 3170 transitions. [2024-11-22 20:58:28,888 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-22 20:58:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 3170 transitions. [2024-11-22 20:58:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 20:58:28,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:28,889 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:28,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-22 20:58:29,092 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-22 20:58:29,092 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-22 20:58:29,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1329278098, now seen corresponding path program 1 times [2024-11-22 20:58:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:29,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346139237] [2024-11-22 20:58:29,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:29,094 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-22 20:58:29,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:29,095 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-22 20:58:29,096 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-22 20:58:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:29,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:58:29,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:29,209 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-22 20:58:29,226 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-22 20:58:29,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:29,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:29,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346139237] [2024-11-22 20:58:29,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346139237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:29,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:29,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:29,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013315550] [2024-11-22 20:58:29,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:29,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:29,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:29,228 INFO L87 Difference]: Start difference. First operand 2072 states and 3170 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-22 20:58:31,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:31,166 INFO L93 Difference]: Finished difference Result 3242 states and 5358 transitions. [2024-11-22 20:58:31,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:31,167 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-22 20:58:31,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:31,182 INFO L225 Difference]: With dead ends: 3242 [2024-11-22 20:58:31,182 INFO L226 Difference]: Without dead ends: 3242 [2024-11-22 20:58:31,183 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-22 20:58:31,183 INFO L432 NwaCegarLoop]: 4761 mSDtfsCounter, 1754 mSDsluCounter, 2259 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2257 SdHoareTripleChecker+Valid, 7020 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:31,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2257 Valid, 7020 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 20:58:31,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2024-11-22 20:58:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2025. [2024-11-22 20:58:31,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 1077 states have (on average 1.9600742804085423) internal successors, (2111), 2018 states have internal predecessors, (2111), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-22 20:58:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 3119 transitions. [2024-11-22 20:58:31,445 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 3119 transitions. Word has length 8 [2024-11-22 20:58:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:31,445 INFO L471 AbstractCegarLoop]: Abstraction has 2025 states and 3119 transitions. [2024-11-22 20:58:31,445 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-22 20:58:31,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 3119 transitions. [2024-11-22 20:58:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 20:58:31,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:31,446 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:31,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-22 20:58:31,646 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-22 20:58:31,647 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-22 20:58:31,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash -282866277, now seen corresponding path program 1 times [2024-11-22 20:58:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502580959] [2024-11-22 20:58:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:31,648 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-22 20:58:31,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:31,649 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-22 20:58:31,650 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-22 20:58:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:31,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:58:31,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:31,812 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-22 20:58:31,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:31,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:31,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502580959] [2024-11-22 20:58:31,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502580959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:31,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:31,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:31,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749522674] [2024-11-22 20:58:31,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:31,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:31,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:31,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:31,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:31,815 INFO L87 Difference]: Start difference. First operand 2025 states and 3119 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-22 20:58:32,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:32,079 INFO L93 Difference]: Finished difference Result 3470 states and 5620 transitions. [2024-11-22 20:58:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:32,080 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-22 20:58:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:32,097 INFO L225 Difference]: With dead ends: 3470 [2024-11-22 20:58:32,097 INFO L226 Difference]: Without dead ends: 3470 [2024-11-22 20:58:32,097 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-22 20:58:32,099 INFO L432 NwaCegarLoop]: 3105 mSDtfsCounter, 1471 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1971 SdHoareTripleChecker+Valid, 6058 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.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:32,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1971 Valid, 6058 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 20:58:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2024-11-22 20:58:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3202. [2024-11-22 20:58:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 1754 states have (on average 1.944697833523375) internal successors, (3411), 3195 states have internal predecessors, (3411), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:32,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5419 transitions. [2024-11-22 20:58:32,322 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5419 transitions. Word has length 11 [2024-11-22 20:58:32,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:32,322 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 5419 transitions. [2024-11-22 20:58:32,322 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-22 20:58:32,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5419 transitions. [2024-11-22 20:58:32,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 20:58:32,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:32,323 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:32,329 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-22 20:58:32,523 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-22 20:58:32,524 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-22 20:58:32,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash -170511720, now seen corresponding path program 1 times [2024-11-22 20:58:32,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:32,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482036353] [2024-11-22 20:58:32,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:32,525 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-22 20:58:32,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:32,528 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-22 20:58:32,530 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-22 20:58:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:32,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:58:32,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:32,646 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-22 20:58:32,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:32,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482036353] [2024-11-22 20:58:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482036353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611225187] [2024-11-22 20:58:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:32,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:32,648 INFO L87 Difference]: Start difference. First operand 3202 states and 5419 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-22 20:58:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:32,694 INFO L93 Difference]: Finished difference Result 3142 states and 5333 transitions. [2024-11-22 20:58:32,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:32,695 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-22 20:58:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:32,715 INFO L225 Difference]: With dead ends: 3142 [2024-11-22 20:58:32,715 INFO L226 Difference]: Without dead ends: 3142 [2024-11-22 20:58:32,715 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-22 20:58:32,716 INFO L432 NwaCegarLoop]: 2982 mSDtfsCounter, 71 mSDsluCounter, 2919 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5901 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-22 20:58:32,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5901 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:32,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2024-11-22 20:58:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3142. [2024-11-22 20:58:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 1718 states have (on average 1.9353899883585564) internal successors, (3325), 3135 states have internal predecessors, (3325), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 5333 transitions. [2024-11-22 20:58:32,951 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 5333 transitions. Word has length 13 [2024-11-22 20:58:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:32,951 INFO L471 AbstractCegarLoop]: Abstraction has 3142 states and 5333 transitions. [2024-11-22 20:58:32,952 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-22 20:58:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 5333 transitions. [2024-11-22 20:58:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 20:58:32,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:32,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:32,957 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-22 20:58:33,153 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-22 20:58:33,154 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:33,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:33,154 INFO L85 PathProgramCache]: Analyzing trace with hash -133316320, now seen corresponding path program 1 times [2024-11-22 20:58:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:33,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433336484] [2024-11-22 20:58:33,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:33,155 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-22 20:58:33,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:33,156 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-22 20:58:33,157 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-22 20:58:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:33,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:58:33,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:33,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:58:33,307 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 20:58:33,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-22 20:58:33,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 20:58:33,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2024-11-22 20:58:33,388 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-22 20:58:33,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:33,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:33,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433336484] [2024-11-22 20:58:33,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433336484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:33,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:33,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602463330] [2024-11-22 20:58:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:33,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:33,390 INFO L87 Difference]: Start difference. First operand 3142 states and 5333 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-22 20:58:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:34,837 INFO L93 Difference]: Finished difference Result 5952 states and 10146 transitions. [2024-11-22 20:58:34,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:34,838 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-22 20:58:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:34,859 INFO L225 Difference]: With dead ends: 5952 [2024-11-22 20:58:34,859 INFO L226 Difference]: Without dead ends: 5952 [2024-11-22 20:58:34,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:34,860 INFO L432 NwaCegarLoop]: 3446 mSDtfsCounter, 1924 mSDsluCounter, 5906 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2427 SdHoareTripleChecker+Valid, 9352 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:34,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2427 Valid, 9352 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 20:58:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-22 20:58:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 3141. [2024-11-22 20:58:35,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 1717 states have (on average 1.9353523587652883) internal successors, (3323), 3134 states have internal predecessors, (3323), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5331 transitions. [2024-11-22 20:58:35,268 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5331 transitions. Word has length 14 [2024-11-22 20:58:35,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:35,269 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5331 transitions. [2024-11-22 20:58:35,269 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-22 20:58:35,269 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5331 transitions. [2024-11-22 20:58:35,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 20:58:35,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:35,270 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-22 20:58:35,275 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-22 20:58:35,470 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-22 20:58:35,471 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:35,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:35,472 INFO L85 PathProgramCache]: Analyzing trace with hash 183846334, now seen corresponding path program 1 times [2024-11-22 20:58:35,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:35,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713688141] [2024-11-22 20:58:35,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:35,473 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-22 20:58:35,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:35,476 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-22 20:58:35,477 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-22 20:58:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:35,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 20:58:35,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:35,633 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-22 20:58:35,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:35,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:35,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713688141] [2024-11-22 20:58:35,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713688141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:35,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:35,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:35,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816094838] [2024-11-22 20:58:35,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:35,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:35,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:35,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:35,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:35,635 INFO L87 Difference]: Start difference. First operand 3141 states and 5331 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-22 20:58:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:35,681 INFO L93 Difference]: Finished difference Result 3081 states and 5245 transitions. [2024-11-22 20:58:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:35,681 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-22 20:58:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:35,690 INFO L225 Difference]: With dead ends: 3081 [2024-11-22 20:58:35,690 INFO L226 Difference]: Without dead ends: 3081 [2024-11-22 20:58:35,690 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-22 20:58:35,691 INFO L432 NwaCegarLoop]: 2939 mSDtfsCounter, 71 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5815 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-22 20:58:35,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5815 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states. [2024-11-22 20:58:35,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 3081. [2024-11-22 20:58:35,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 1681 states have (on average 1.925639500297442) internal successors, (3237), 3074 states have internal predecessors, (3237), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 5245 transitions. [2024-11-22 20:58:35,894 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 5245 transitions. Word has length 18 [2024-11-22 20:58:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 3081 states and 5245 transitions. [2024-11-22 20:58:35,895 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-22 20:58:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 5245 transitions. [2024-11-22 20:58:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 20:58:35,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:35,895 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-22 20:58:35,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-22 20:58:36,096 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-22 20:58:36,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:36,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash 582665080, now seen corresponding path program 1 times [2024-11-22 20:58:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:36,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582984956] [2024-11-22 20:58:36,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:36,097 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-22 20:58:36,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:36,100 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-22 20:58:36,102 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-22 20:58:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:36,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:58:36,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:36,277 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-22 20:58:36,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:36,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582984956] [2024-11-22 20:58:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582984956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:36,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:36,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234618291] [2024-11-22 20:58:36,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:36,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:36,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:36,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:36,279 INFO L87 Difference]: Start difference. First operand 3081 states and 5245 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-22 20:58:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:36,365 INFO L93 Difference]: Finished difference Result 3051 states and 5187 transitions. [2024-11-22 20:58:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:58:36,365 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-22 20:58:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:36,375 INFO L225 Difference]: With dead ends: 3051 [2024-11-22 20:58:36,375 INFO L226 Difference]: Without dead ends: 3051 [2024-11-22 20:58:36,376 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-22 20:58:36,376 INFO L432 NwaCegarLoop]: 2894 mSDtfsCounter, 48 mSDsluCounter, 5762 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 8656 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-22 20:58:36,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 8656 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2024-11-22 20:58:36,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3051. [2024-11-22 20:58:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3051 states, 1665 states have (on average 1.9093093093093092) internal successors, (3179), 3044 states have internal predecessors, (3179), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:36,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 5187 transitions. [2024-11-22 20:58:36,580 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 5187 transitions. Word has length 20 [2024-11-22 20:58:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 3051 states and 5187 transitions. [2024-11-22 20:58:36,581 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-22 20:58:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 5187 transitions. [2024-11-22 20:58:36,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 20:58:36,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:36,583 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-22 20:58:36,588 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-22 20:58:36,786 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-22 20:58:36,787 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:36,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:36,787 INFO L85 PathProgramCache]: Analyzing trace with hash -195006074, now seen corresponding path program 1 times [2024-11-22 20:58:36,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:36,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567292342] [2024-11-22 20:58:36,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:36,788 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-22 20:58:36,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:36,789 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-22 20:58:36,790 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-22 20:58:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:36,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:58:36,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:36,945 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-22 20:58:37,004 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-22 20:58:37,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:37,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:37,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567292342] [2024-11-22 20:58:37,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567292342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780017665] [2024-11-22 20:58:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:37,006 INFO L87 Difference]: Start difference. First operand 3051 states and 5187 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-22 20:58:40,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:40,381 INFO L93 Difference]: Finished difference Result 3055 states and 5187 transitions. [2024-11-22 20:58:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:40,382 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-22 20:58:40,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:40,390 INFO L225 Difference]: With dead ends: 3055 [2024-11-22 20:58:40,391 INFO L226 Difference]: Without dead ends: 3055 [2024-11-22 20:58:40,391 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-22 20:58:40,391 INFO L432 NwaCegarLoop]: 2580 mSDtfsCounter, 1644 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 4124 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:40,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 4124 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-22 20:58:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2024-11-22 20:58:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3047. [2024-11-22 20:58:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3047 states, 1665 states have (on average 1.9045045045045046) internal successors, (3171), 3040 states have internal predecessors, (3171), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3047 states to 3047 states and 5179 transitions. [2024-11-22 20:58:40,640 INFO L78 Accepts]: Start accepts. Automaton has 3047 states and 5179 transitions. Word has length 34 [2024-11-22 20:58:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 3047 states and 5179 transitions. [2024-11-22 20:58:40,641 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-22 20:58:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3047 states and 5179 transitions. [2024-11-22 20:58:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 20:58:40,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:40,643 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-22 20:58:40,649 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-22 20:58:40,844 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-22 20:58:40,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -195006073, now seen corresponding path program 1 times [2024-11-22 20:58:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275420287] [2024-11-22 20:58:40,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:40,846 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-22 20:58:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:40,847 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-22 20:58:40,848 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-22 20:58:40,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:40,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 20:58:40,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:40,999 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-22 20:58:41,163 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-22 20:58:41,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:41,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:41,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275420287] [2024-11-22 20:58:41,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275420287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:41,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:41,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:41,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703497554] [2024-11-22 20:58:41,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:41,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:41,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:41,164 INFO L87 Difference]: Start difference. First operand 3047 states and 5179 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-22 20:58:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:45,383 INFO L93 Difference]: Finished difference Result 5346 states and 9500 transitions. [2024-11-22 20:58:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:45,384 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-22 20:58:45,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:45,399 INFO L225 Difference]: With dead ends: 5346 [2024-11-22 20:58:45,399 INFO L226 Difference]: Without dead ends: 5346 [2024-11-22 20:58:45,400 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-22 20:58:45,400 INFO L432 NwaCegarLoop]: 4937 mSDtfsCounter, 1391 mSDsluCounter, 5926 mSDsCounter, 0 mSdLazyCounter, 2594 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 10863 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:45,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 10863 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2594 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-22 20:58:45,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2024-11-22 20:58:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 3043. [2024-11-22 20:58:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3043 states, 1665 states have (on average 1.8996996996996998) internal successors, (3163), 3036 states have internal predecessors, (3163), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3043 states to 3043 states and 5171 transitions. [2024-11-22 20:58:45,853 INFO L78 Accepts]: Start accepts. Automaton has 3043 states and 5171 transitions. Word has length 34 [2024-11-22 20:58:45,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:45,854 INFO L471 AbstractCegarLoop]: Abstraction has 3043 states and 5171 transitions. [2024-11-22 20:58:45,854 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-22 20:58:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3043 states and 5171 transitions. [2024-11-22 20:58:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 20:58:45,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:45,859 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-22 20:58:45,865 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-22 20:58:46,059 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-22 20:58:46,060 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:46,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:46,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1181697534, now seen corresponding path program 1 times [2024-11-22 20:58:46,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:46,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96921525] [2024-11-22 20:58:46,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:46,061 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-22 20:58:46,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:46,063 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-22 20:58:46,064 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-22 20:58:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:46,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:58:46,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:46,334 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-22 20:58:46,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:46,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:46,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96921525] [2024-11-22 20:58:46,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96921525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:46,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:46,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:46,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859950] [2024-11-22 20:58:46,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:46,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:46,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:46,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:46,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:46,336 INFO L87 Difference]: Start difference. First operand 3043 states and 5171 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-22 20:58:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:46,409 INFO L93 Difference]: Finished difference Result 3031 states and 5151 transitions. [2024-11-22 20:58:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:58:46,410 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-22 20:58:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:46,422 INFO L225 Difference]: With dead ends: 3031 [2024-11-22 20:58:46,422 INFO L226 Difference]: Without dead ends: 3031 [2024-11-22 20:58:46,423 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-22 20:58:46,424 INFO L432 NwaCegarLoop]: 2888 mSDtfsCounter, 21 mSDsluCounter, 5745 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 8633 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-22 20:58:46,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 8633 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:46,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3031 states. [2024-11-22 20:58:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 3031. [2024-11-22 20:58:46,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 1653 states have (on average 1.9013914095583786) internal successors, (3143), 3024 states have internal predecessors, (3143), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 5151 transitions. [2024-11-22 20:58:46,689 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 5151 transitions. Word has length 53 [2024-11-22 20:58:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:46,691 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 5151 transitions. [2024-11-22 20:58:46,691 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-22 20:58:46,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 5151 transitions. [2024-11-22 20:58:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-22 20:58:46,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:46,693 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-22 20:58:46,701 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-22 20:58:46,893 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-22 20:58:46,894 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-22 20:58:46,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1740051530, now seen corresponding path program 1 times [2024-11-22 20:58:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586988290] [2024-11-22 20:58:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:46,895 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-22 20:58:46,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:46,899 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-22 20:58:46,901 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-22 20:58:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:47,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 20:58:47,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:47,191 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-22 20:58:47,198 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-22 20:58:47,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:58:47,707 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-22 20:58:47,721 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 20:58:47,722 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-22 20:58:47,737 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-22 20:58:47,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:47,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:47,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586988290] [2024-11-22 20:58:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586988290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:47,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:47,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368184824] [2024-11-22 20:58:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:47,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:47,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:47,739 INFO L87 Difference]: Start difference. First operand 3031 states and 5151 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-22 20:58:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:49,991 INFO L93 Difference]: Finished difference Result 2993 states and 5113 transitions. [2024-11-22 20:58:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:49,991 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-22 20:58:49,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:50,001 INFO L225 Difference]: With dead ends: 2993 [2024-11-22 20:58:50,002 INFO L226 Difference]: Without dead ends: 2993 [2024-11-22 20:58:50,002 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-22 20:58:50,002 INFO L432 NwaCegarLoop]: 2459 mSDtfsCounter, 1570 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2073 SdHoareTripleChecker+Valid, 2641 SdHoareTripleChecker+Invalid, 1739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:50,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2073 Valid, 2641 Invalid, 1739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-22 20:58:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2024-11-22 20:58:50,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 2956. [2024-11-22 20:58:50,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2956 states, 1616 states have (on average 1.875618811881188) internal successors, (3031), 2949 states have internal predecessors, (3031), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2956 states to 2956 states and 5039 transitions. [2024-11-22 20:58:50,237 INFO L78 Accepts]: Start accepts. Automaton has 2956 states and 5039 transitions. Word has length 61 [2024-11-22 20:58:50,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:50,237 INFO L471 AbstractCegarLoop]: Abstraction has 2956 states and 5039 transitions. [2024-11-22 20:58:50,237 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-22 20:58:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2956 states and 5039 transitions. [2024-11-22 20:58:50,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-22 20:58:50,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:50,238 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-22 20:58:50,247 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-22 20:58:50,438 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-22 20:58:50,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:50,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454369, now seen corresponding path program 1 times [2024-11-22 20:58:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:50,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891210712] [2024-11-22 20:58:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:50,440 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-22 20:58:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:50,444 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-22 20:58:50,445 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-22 20:58:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:50,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 20:58:50,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:50,721 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-22 20:58:50,735 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-22 20:58:50,754 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-22 20:58:50,765 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-22 20:58:50,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:50,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891210712] [2024-11-22 20:58:50,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891210712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:50,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:50,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:50,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255914748] [2024-11-22 20:58:50,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:50,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:58:50,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:50,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:58:50,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:50,767 INFO L87 Difference]: Start difference. First operand 2956 states and 5039 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-22 20:58:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:52,265 INFO L93 Difference]: Finished difference Result 2955 states and 5038 transitions. [2024-11-22 20:58:52,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:58:52,266 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-22 20:58:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:52,273 INFO L225 Difference]: With dead ends: 2955 [2024-11-22 20:58:52,273 INFO L226 Difference]: Without dead ends: 2955 [2024-11-22 20:58:52,274 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-22 20:58:52,274 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 2 mSDsluCounter, 7372 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 10233 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-22 20:58:52,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 10233 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-22 20:58:52,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2024-11-22 20:58:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2024-11-22 20:58:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 1616 states have (on average 1.875) internal successors, (3030), 2948 states have internal predecessors, (3030), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 5038 transitions. [2024-11-22 20:58:52,596 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 5038 transitions. Word has length 66 [2024-11-22 20:58:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:52,596 INFO L471 AbstractCegarLoop]: Abstraction has 2955 states and 5038 transitions. [2024-11-22 20:58:52,596 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-22 20:58:52,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 5038 transitions. [2024-11-22 20:58:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-22 20:58:52,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:52,597 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-22 20:58:52,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-22 20:58:52,798 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-22 20:58:52,798 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:52,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1654454368, now seen corresponding path program 1 times [2024-11-22 20:58:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767160068] [2024-11-22 20:58:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:52,799 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-22 20:58:52,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:52,801 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-22 20:58:52,802 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-22 20:58:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:53,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 20:58:53,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:53,063 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-22 20:58:53,082 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-22 20:58:53,090 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-22 20:58:53,127 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-22 20:58:53,142 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-22 20:58:53,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:53,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767160068] [2024-11-22 20:58:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767160068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549196102] [2024-11-22 20:58:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:53,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:58:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:58:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:53,144 INFO L87 Difference]: Start difference. First operand 2955 states and 5038 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-22 20:58:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:54,842 INFO L93 Difference]: Finished difference Result 2954 states and 5037 transitions. [2024-11-22 20:58:54,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:58:54,842 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-22 20:58:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:54,849 INFO L225 Difference]: With dead ends: 2954 [2024-11-22 20:58:54,849 INFO L226 Difference]: Without dead ends: 2954 [2024-11-22 20:58:54,849 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-22 20:58:54,850 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 1 mSDsluCounter, 7405 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10266 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-22 20:58:54,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10266 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 20:58:54,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2024-11-22 20:58:55,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2954. [2024-11-22 20:58:55,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2954 states, 1615 states have (on average 1.8755417956656346) internal successors, (3029), 2947 states have internal predecessors, (3029), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-22 20:58:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2954 states to 2954 states and 5037 transitions. [2024-11-22 20:58:55,032 INFO L78 Accepts]: Start accepts. Automaton has 2954 states and 5037 transitions. Word has length 66 [2024-11-22 20:58:55,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:55,032 INFO L471 AbstractCegarLoop]: Abstraction has 2954 states and 5037 transitions. [2024-11-22 20:58:55,032 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-22 20:58:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2954 states and 5037 transitions. [2024-11-22 20:58:55,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 20:58:55,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:55,033 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-22 20:58:55,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-22 20:58:55,233 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-22 20:58:55,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-22 20:58:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash -620255098, now seen corresponding path program 1 times [2024-11-22 20:58:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294565906] [2024-11-22 20:58:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:55,236 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-22 20:58:55,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:55,239 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-22 20:58:55,240 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-22 20:58:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:55,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 20:58:55,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:55,541 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-22 20:58:55,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 20:58:55,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294565906] [2024-11-22 20:58:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294565906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706881166] [2024-11-22 20:58:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:55,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:55,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:55,543 INFO L87 Difference]: Start difference. First operand 2954 states and 5037 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-22 20:58:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:55,606 INFO L93 Difference]: Finished difference Result 2957 states and 5041 transitions. [2024-11-22 20:58:55,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:55,607 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-22 20:58:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:55,620 INFO L225 Difference]: With dead ends: 2957 [2024-11-22 20:58:55,620 INFO L226 Difference]: Without dead ends: 2957 [2024-11-22 20:58:55,621 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-22 20:58:55,621 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 0 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8578 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-22 20:58:55,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8578 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:55,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2024-11-22 20:58:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2957. [2024-11-22 20:58:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1617 states have (on average 1.8750773036487323) internal successors, (3032), 2950 states have internal predecessors, (3032), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-22 20:58:55,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 5041 transitions. [2024-11-22 20:58:55,852 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 5041 transitions. Word has length 74 [2024-11-22 20:58:55,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:55,853 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 5041 transitions. [2024-11-22 20:58:55,853 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-22 20:58:55,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 5041 transitions. [2024-11-22 20:58:55,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 20:58:55,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:55,854 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-22 20:58:55,864 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-22 20:58:56,054 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-22 20:58:56,055 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-22 20:58:56,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:56,056 INFO L85 PathProgramCache]: Analyzing trace with hash 537846652, now seen corresponding path program 1 times [2024-11-22 20:58:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816202178] [2024-11-22 20:58:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:56,057 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-22 20:58:56,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:56,060 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-22 20:58:56,061 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-22 20:58:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:56,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-22 20:58:56,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:56,369 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-22 20:58:56,369 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:58:56,428 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-22 20:58:56,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:56,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816202178] [2024-11-22 20:58:56,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816202178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:58:56,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:58:56,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 20:58:56,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339895816] [2024-11-22 20:58:56,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:58:56,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 20:58:56,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:56,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 20:58:56,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 20:58:56,431 INFO L87 Difference]: Start difference. First operand 2957 states and 5041 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-22 20:58:56,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:56,589 INFO L93 Difference]: Finished difference Result 2969 states and 5058 transitions. [2024-11-22 20:58:56,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 20:58:56,590 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-22 20:58:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:56,600 INFO L225 Difference]: With dead ends: 2969 [2024-11-22 20:58:56,600 INFO L226 Difference]: Without dead ends: 2969 [2024-11-22 20:58:56,600 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-22 20:58:56,601 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 5 mSDsluCounter, 11430 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14291 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:56,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14291 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 20:58:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2969 states. [2024-11-22 20:58:56,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2969 to 2967. [2024-11-22 20:58:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2967 states, 1626 states have (on average 1.8739237392373924) internal successors, (3047), 2959 states have internal predecessors, (3047), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-22 20:58:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 5056 transitions. [2024-11-22 20:58:56,890 INFO L78 Accepts]: Start accepts. Automaton has 2967 states and 5056 transitions. Word has length 75 [2024-11-22 20:58:56,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:56,890 INFO L471 AbstractCegarLoop]: Abstraction has 2967 states and 5056 transitions. [2024-11-22 20:58:56,890 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-22 20:58:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2967 states and 5056 transitions. [2024-11-22 20:58:56,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 20:58:56,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:56,892 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-22 20:58:56,902 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-22 20:58:57,092 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-22 20:58:57,093 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-22 20:58:57,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2139507194, now seen corresponding path program 2 times [2024-11-22 20:58:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751299997] [2024-11-22 20:58:57,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 20:58:57,095 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-22 20:58:57,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:57,098 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-22 20:58:57,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-22 20:58:57,619 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 20:58:57,619 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:58:57,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 20:58:57,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:57,685 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-22 20:58:57,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:58:57,823 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-22 20:58:57,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:58:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751299997] [2024-11-22 20:58:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751299997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:58:57,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:58:57,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-22 20:58:57,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436509815] [2024-11-22 20:58:57,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:58:57,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 20:58:57,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:58:57,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 20:58:57,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-22 20:58:57,826 INFO L87 Difference]: Start difference. First operand 2967 states and 5056 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-22 20:58:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:58,322 INFO L93 Difference]: Finished difference Result 2982 states and 5078 transitions. [2024-11-22 20:58:58,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 20:58:58,323 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-22 20:58:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:58,340 INFO L225 Difference]: With dead ends: 2982 [2024-11-22 20:58:58,340 INFO L226 Difference]: Without dead ends: 2978 [2024-11-22 20:58:58,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-22 20:58:58,344 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 11 mSDsluCounter, 17150 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20011 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:58,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 20011 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 20:58:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2024-11-22 20:58:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2976. [2024-11-22 20:58:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 1635 states have (on average 1.8709480122324158) internal successors, (3059), 2968 states have internal predecessors, (3059), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-22 20:58:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5068 transitions. [2024-11-22 20:58:58,639 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5068 transitions. Word has length 78 [2024-11-22 20:58:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:58,640 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5068 transitions. [2024-11-22 20:58:58,640 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-22 20:58:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5068 transitions. [2024-11-22 20:58:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-22 20:58:58,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:58,641 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-22 20:58:58,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-11-22 20:58:58,844 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-22 20:58:58,845 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-22 20:58:58,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:58,846 INFO L85 PathProgramCache]: Analyzing trace with hash -114974138, now seen corresponding path program 3 times [2024-11-22 20:58:58,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:58:58,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2050330361] [2024-11-22 20:58:58,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 20:58:58,847 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-22 20:58:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:58:58,849 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-22 20:58:58,851 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-22 20:58:59,589 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 20:58:59,589 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:58:59,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 20:58:59,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:59,753 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-22 20:58:59,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:00,228 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-22 20:59:00,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:59:00,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2050330361] [2024-11-22 20:59:00,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2050330361] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:59:00,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:00,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-22 20:59:00,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823665989] [2024-11-22 20:59:00,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:00,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 20:59:00,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:59:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 20:59:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-22 20:59:00,231 INFO L87 Difference]: Start difference. First operand 2976 states and 5068 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-22 20:59:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:01,793 INFO L93 Difference]: Finished difference Result 3000 states and 5107 transitions. [2024-11-22 20:59:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 20:59:01,794 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-22 20:59:01,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:01,803 INFO L225 Difference]: With dead ends: 3000 [2024-11-22 20:59:01,803 INFO L226 Difference]: Without dead ends: 2994 [2024-11-22 20:59:01,804 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-22 20:59:01,805 INFO L432 NwaCegarLoop]: 2862 mSDtfsCounter, 23 mSDsluCounter, 34307 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 37169 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:01,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 37169 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 20:59:01,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2024-11-22 20:59:02,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2994. [2024-11-22 20:59:02,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2994 states, 1653 states have (on average 1.8644888082274653) internal successors, (3082), 2986 states have internal predecessors, (3082), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-22 20:59:02,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2994 states to 2994 states and 5091 transitions. [2024-11-22 20:59:02,160 INFO L78 Accepts]: Start accepts. Automaton has 2994 states and 5091 transitions. Word has length 84 [2024-11-22 20:59:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:02,160 INFO L471 AbstractCegarLoop]: Abstraction has 2994 states and 5091 transitions. [2024-11-22 20:59:02,160 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-22 20:59:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2994 states and 5091 transitions. [2024-11-22 20:59:02,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 20:59:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:02,162 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-22 20:59:02,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-22 20:59:02,362 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-22 20:59:02,362 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-22 20:59:02,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1196758330, now seen corresponding path program 4 times [2024-11-22 20:59:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:59:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769312682] [2024-11-22 20:59:02,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 20:59:02,364 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-22 20:59:02,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:59:02,369 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-22 20:59:02,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-22 20:59:02,925 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 20:59:02,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:59:02,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-22 20:59:02,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:03,256 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-22 20:59:03,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:04,442 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-22 20:59:04,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:59:04,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769312682] [2024-11-22 20:59:04,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769312682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 20:59:04,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:04,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-22 20:59:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482190018] [2024-11-22 20:59:04,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:04,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-22 20:59:04,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 20:59:04,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-22 20:59:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 20:59:04,446 INFO L87 Difference]: Start difference. First operand 2994 states and 5091 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-22 20:59:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:08,794 INFO L93 Difference]: Finished difference Result 3034 states and 5163 transitions. [2024-11-22 20:59:08,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-22 20:59:08,795 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-22 20:59:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:08,807 INFO L225 Difference]: With dead ends: 3034 [2024-11-22 20:59:08,807 INFO L226 Difference]: Without dead ends: 3030 [2024-11-22 20:59:08,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-22 20:59:08,811 INFO L432 NwaCegarLoop]: 2861 mSDtfsCounter, 47 mSDsluCounter, 74305 mSDsCounter, 0 mSdLazyCounter, 1937 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 77166 SdHoareTripleChecker+Invalid, 2003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:08,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 77166 Invalid, 2003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 1937 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 20:59:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2024-11-22 20:59:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 3028. [2024-11-22 20:59:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 1687 states have (on average 1.8541790160047422) internal successors, (3128), 3020 states have internal predecessors, (3128), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-22 20:59:09,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5137 transitions. [2024-11-22 20:59:09,059 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5137 transitions. Word has length 96 [2024-11-22 20:59:09,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5137 transitions. [2024-11-22 20:59:09,060 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-22 20:59:09,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5137 transitions. [2024-11-22 20:59:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-22 20:59:09,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:09,061 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-22 20:59:09,073 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-22 20:59:09,261 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-22 20:59:09,262 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-22 20:59:09,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:09,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1074332410, now seen corresponding path program 5 times [2024-11-22 20:59:09,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 20:59:09,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650292157] [2024-11-22 20:59:09,263 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:59:09,263 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-22 20:59:09,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 20:59:09,264 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-22 20:59:09,266 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-22 20:59:10,404 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-22 20:59:10,404 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 20:59:10,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-22 20:59:10,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:10,437 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-22 20:59:10,522 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-22 20:59:10,523 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-22 20:59:10,545 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-22 20:59:10,610 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-22 20:59:11,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:11,554 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-22 20:59:11,592 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-22 20:59:11,614 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-22 20:59:11,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:11,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-22 20:59:11,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 20:59:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650292157] [2024-11-22 20:59:11,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650292157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:11,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [311827442] [2024-11-22 20:59:11,925 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 20:59:11,925 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 20:59:11,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 20:59:11,926 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 20:59:11,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process