./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:03:00,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:03:00,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:03:00,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:03:00,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:03:00,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:03:00,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:03:00,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:03:00,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:03:00,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:03:00,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:03:00,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:03:00,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:03:00,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:03:00,230 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:03:00,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:03:00,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:03:00,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:03:00,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:03:00,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:03:00,231 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:03:00,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:03:00,235 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:03:00,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:03:00,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:03:00,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:03:00,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:03:00,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:03:00,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:03:00,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:03:00,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:03:00,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:03:00,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:03:00,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:03:00,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:03:00,238 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:03:00,238 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-10-13 12:03:00,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:03:00,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:03:00,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:03:00,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:03:00,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:03:00,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-13 12:03:01,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:03:02,015 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:03:02,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-13 12:03:02,035 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa71a531/1ad16cb0c9c84889930ffc7a3589540a/FLAG7c7c688f9 [2024-10-13 12:03:02,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/caa71a531/1ad16cb0c9c84889930ffc7a3589540a [2024-10-13 12:03:02,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:03:02,317 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:03:02,318 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:03:02,318 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:03:02,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:03:02,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:03:02" (1/1) ... [2024-10-13 12:03:02,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c380501 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:02, skipping insertion in model container [2024-10-13 12:03:02,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:03:02" (1/1) ... [2024-10-13 12:03:02,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:03:02,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:03:02,849 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 12:03:02,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@37400015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:02, skipping insertion in model container [2024-10-13 12:03:02,849 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:03:02,850 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:03:02,851 INFO L158 Benchmark]: Toolchain (without parser) took 533.03ms. Allocated memory is still 169.9MB. Free memory was 134.3MB in the beginning and 102.9MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 12:03:02,851 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 117.4MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:03:02,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.48ms. Allocated memory is still 169.9MB. Free memory was 134.3MB in the beginning and 102.9MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 12:03:02,853 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.08ms. Allocated memory is still 117.4MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.48ms. Allocated memory is still 169.9MB. Free memory was 134.3MB in the beginning and 102.9MB in the end (delta: 31.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:03:04,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:03:04,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:03:04,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:03:04,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:03:04,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:03:04,501 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:03:04,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:03:04,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:03:04,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:03:04,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:03:04,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:03:04,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:03:04,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:03:04,504 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:03:04,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:03:04,504 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:03:04,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:03:04,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:03:04,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:03:04,505 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:03:04,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:03:04,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:03:04,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:03:04,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:03:04,511 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:03:04,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:03:04,512 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:03:04,512 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:03:04,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:03:04,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:03:04,512 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:03:04,512 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:03:04,512 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:03:04,513 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:03:04,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:03:04,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:03:04,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:03:04,518 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:03:04,518 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:03:04,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:03:04,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:03:04,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:03:04,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:03:04,520 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:03:04,520 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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2024-10-13 12:03:04,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:03:04,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:03:04,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:03:04,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:03:04,796 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:03:04,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-13 12:03:06,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:03:06,113 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 12:03:06,385 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:03:06,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-13 12:03:06,405 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19bb16cb/a3346387861741819b1c9b86a8cd5389/FLAG5e919db7c [2024-10-13 12:03:06,417 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19bb16cb/a3346387861741819b1c9b86a8cd5389 [2024-10-13 12:03:06,419 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:03:06,420 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:03:06,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:03:06,422 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:03:06,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:03:06,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:03:06" (1/1) ... [2024-10-13 12:03:06,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b7f6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:06, skipping insertion in model container [2024-10-13 12:03:06,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:03:06" (1/1) ... [2024-10-13 12:03:06,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:03:06,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:03:06,993 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:03:07,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:03:07,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:03:07,131 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:03:07,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:03:07,269 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:03:07,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07 WrapperNode [2024-10-13 12:03:07,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:03:07,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:03:07,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:03:07,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:03:07,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,377 INFO L138 Inliner]: procedures = 180, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2272 [2024-10-13 12:03:07,377 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:03:07,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:03:07,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:03:07,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:03:07,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,521 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [372, 2, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 86 writes are split as follows [82, 0, 4]. [2024-10-13 12:03:07,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,592 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:03:07,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:03:07,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:03:07,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:03:07,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (1/1) ... [2024-10-13 12:03:07,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:03:07,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:03:07,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:03:07,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:03:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 12:03:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 12:03:07,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 12:03:07,696 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-13 12:03:07,696 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 12:03:07,697 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 12:03:07,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 12:03:07,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 12:03:07,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 12:03:07,698 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 12:03:07,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:03:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:03:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:03:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:03:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:03:07,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:03:07,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:03:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:03:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:03:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:03:07,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:03:07,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:03:07,910 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:03:07,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:03:07,954 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:03:07,974 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:03:07,989 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 12:03:12,978 INFO L? ?]: Removed 2009 outVars from TransFormulas that were not future-live. [2024-10-13 12:03:12,979 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:03:13,182 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:03:13,182 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-13 12:03:13,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:13 BoogieIcfgContainer [2024-10-13 12:03:13,183 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:03:13,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:03:13,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:03:13,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:03:13,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:03:06" (1/3) ... [2024-10-13 12:03:13,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efdfded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:03:13, skipping insertion in model container [2024-10-13 12:03:13,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:03:07" (2/3) ... [2024-10-13 12:03:13,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efdfded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:03:13, skipping insertion in model container [2024-10-13 12:03:13,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:03:13" (3/3) ... [2024-10-13 12:03:13,189 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2024-10-13 12:03:13,205 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:03:13,206 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-10-13 12:03:13,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:03:13,263 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;@2e9e839b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:03:13,264 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-10-13 12:03:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 1877 states, 879 states have (on average 2.4436860068259385) internal successors, (2148), 1863 states have internal predecessors, (2148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 12:03:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 12:03:13,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:13,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 12:03:13,276 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:13,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 110388, now seen corresponding path program 1 times [2024-10-13 12:03:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:13,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701428057] [2024-10-13 12:03:13,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:13,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:13,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:13,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:13,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:03:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:13,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:03:13,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:13,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:03:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:13,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:13,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701428057] [2024-10-13 12:03:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701428057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:13,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:13,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:03:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744567376] [2024-10-13 12:03:13,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:13,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:13,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:13,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:13,517 INFO L87 Difference]: Start difference. First operand has 1877 states, 879 states have (on average 2.4436860068259385) internal successors, (2148), 1863 states have internal predecessors, (2148), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:15,707 INFO L93 Difference]: Finished difference Result 2312 states and 2476 transitions. [2024-10-13 12:03:15,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 12:03:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:15,730 INFO L225 Difference]: With dead ends: 2312 [2024-10-13 12:03:15,730 INFO L226 Difference]: Without dead ends: 2311 [2024-10-13 12:03:15,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:15,733 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 1769 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1370 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:15,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1370 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 12:03:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-13 12:03:15,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1986. [2024-10-13 12:03:15,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1016 states have (on average 2.2401574803149606) internal successors, (2276), 1970 states have internal predecessors, (2276), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 12:03:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2308 transitions. [2024-10-13 12:03:15,839 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2308 transitions. Word has length 2 [2024-10-13 12:03:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:15,839 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2308 transitions. [2024-10-13 12:03:15,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:15,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2308 transitions. [2024-10-13 12:03:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 12:03:15,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:15,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 12:03:15,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 12:03:16,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:16,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:16,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:16,043 INFO L85 PathProgramCache]: Analyzing trace with hash 110389, now seen corresponding path program 1 times [2024-10-13 12:03:16,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:16,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847292478] [2024-10-13 12:03:16,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:16,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:16,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:16,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:16,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:03:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:16,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:03:16,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:16,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:03:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:16,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:16,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847292478] [2024-10-13 12:03:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847292478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:16,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:16,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:03:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707246241] [2024-10-13 12:03:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:16,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:16,192 INFO L87 Difference]: Start difference. First operand 1986 states and 2308 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:19,547 INFO L93 Difference]: Finished difference Result 2711 states and 3113 transitions. [2024-10-13 12:03:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:19,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 12:03:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:19,559 INFO L225 Difference]: With dead ends: 2711 [2024-10-13 12:03:19,561 INFO L226 Difference]: Without dead ends: 2711 [2024-10-13 12:03:19,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:19,563 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 799 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 1461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:19,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2504 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 12:03:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2024-10-13 12:03:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2383. [2024-10-13 12:03:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1411 states have (on average 2.179305457122608) internal successors, (3075), 2364 states have internal predecessors, (3075), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 12:03:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3113 transitions. [2024-10-13 12:03:19,624 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3113 transitions. Word has length 2 [2024-10-13 12:03:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:19,624 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3113 transitions. [2024-10-13 12:03:19,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:19,625 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3113 transitions. [2024-10-13 12:03:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 12:03:19,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:19,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:03:19,629 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-10-13 12:03:19,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:19,829 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:19,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:19,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1132525186, now seen corresponding path program 1 times [2024-10-13 12:03:19,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:19,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515480332] [2024-10-13 12:03:19,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:19,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:19,837 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:19,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:03:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:19,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:03:19,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:20,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:03:20,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:03:20,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:03:20,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:03:20,116 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:03:20,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:03:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:20,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:20,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:20,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515480332] [2024-10-13 12:03:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515480332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:20,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:20,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:03:20,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808823743] [2024-10-13 12:03:20,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:20,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:20,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:20,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:20,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:20,145 INFO L87 Difference]: Start difference. First operand 2383 states and 3113 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:27,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:27,170 INFO L93 Difference]: Finished difference Result 4425 states and 5305 transitions. [2024-10-13 12:03:27,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:03:27,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 12:03:27,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:27,182 INFO L225 Difference]: With dead ends: 4425 [2024-10-13 12:03:27,183 INFO L226 Difference]: Without dead ends: 4425 [2024-10-13 12:03:27,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:27,186 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 2161 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2170 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:27,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2091 Invalid, 3864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-10-13 12:03:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2024-10-13 12:03:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 2957. [2024-10-13 12:03:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2957 states, 1985 states have (on average 2.234256926952141) internal successors, (4435), 2932 states have internal predecessors, (4435), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4485 transitions. [2024-10-13 12:03:27,245 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4485 transitions. Word has length 6 [2024-10-13 12:03:27,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:27,246 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 4485 transitions. [2024-10-13 12:03:27,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4485 transitions. [2024-10-13 12:03:27,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:03:27,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:27,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:27,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 12:03:27,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:27,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:27,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -748542378, now seen corresponding path program 1 times [2024-10-13 12:03:27,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:27,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365093408] [2024-10-13 12:03:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:27,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:27,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:27,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:27,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:03:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:27,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:03:27,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:27,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:03:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:27,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:27,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:27,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365093408] [2024-10-13 12:03:27,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365093408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:27,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:03:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892355413] [2024-10-13 12:03:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:27,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:27,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:27,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:27,626 INFO L87 Difference]: Start difference. First operand 2957 states and 4485 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:29,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:29,971 INFO L93 Difference]: Finished difference Result 3593 states and 5079 transitions. [2024-10-13 12:03:29,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:29,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:03:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:29,980 INFO L225 Difference]: With dead ends: 3593 [2024-10-13 12:03:29,980 INFO L226 Difference]: Without dead ends: 3593 [2024-10-13 12:03:29,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:29,981 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 1726 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:29,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2154 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 12:03:29,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-10-13 12:03:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2865. [2024-10-13 12:03:30,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2865 states, 1985 states have (on average 2.1259445843828715) internal successors, (4220), 2840 states have internal predecessors, (4220), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:30,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4270 transitions. [2024-10-13 12:03:30,025 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4270 transitions. Word has length 7 [2024-10-13 12:03:30,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:30,026 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 4270 transitions. [2024-10-13 12:03:30,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:30,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4270 transitions. [2024-10-13 12:03:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 12:03:30,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:30,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:30,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:03:30,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:30,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash -748542377, now seen corresponding path program 1 times [2024-10-13 12:03:30,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139649530] [2024-10-13 12:03:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:30,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:30,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:03:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:30,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:03:30,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:30,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:03:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:30,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:30,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:30,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139649530] [2024-10-13 12:03:30,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139649530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:30,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:30,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:03:30,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160498094] [2024-10-13 12:03:30,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:30,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:30,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:30,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:30,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:30,430 INFO L87 Difference]: Start difference. First operand 2865 states and 4270 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:34,103 INFO L93 Difference]: Finished difference Result 4436 states and 6495 transitions. [2024-10-13 12:03:34,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:34,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 12:03:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:34,115 INFO L225 Difference]: With dead ends: 4436 [2024-10-13 12:03:34,115 INFO L226 Difference]: Without dead ends: 4436 [2024-10-13 12:03:34,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:34,116 INFO L432 NwaCegarLoop]: 1961 mSDtfsCounter, 1287 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:34,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2788 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 12:03:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-10-13 12:03:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3133. [2024-10-13 12:03:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2263 states have (on average 2.114007954043305) internal successors, (4784), 3108 states have internal predecessors, (4784), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:34,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4834 transitions. [2024-10-13 12:03:34,172 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4834 transitions. Word has length 7 [2024-10-13 12:03:34,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:34,173 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4834 transitions. [2024-10-13 12:03:34,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4834 transitions. [2024-10-13 12:03:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 12:03:34,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:34,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:34,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 12:03:34,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:34,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr638REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:34,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1658779517, now seen corresponding path program 1 times [2024-10-13 12:03:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:34,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684802458] [2024-10-13 12:03:34,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:34,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:34,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:34,381 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:34,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:03:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:34,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:03:34,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:34,533 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:34,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684802458] [2024-10-13 12:03:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684802458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:03:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178025879] [2024-10-13 12:03:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:34,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:34,535 INFO L87 Difference]: Start difference. First operand 3133 states and 4834 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:35,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:35,430 INFO L93 Difference]: Finished difference Result 3079 states and 4754 transitions. [2024-10-13 12:03:35,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:35,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 12:03:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:35,440 INFO L225 Difference]: With dead ends: 3079 [2024-10-13 12:03:35,440 INFO L226 Difference]: Without dead ends: 3079 [2024-10-13 12:03:35,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:35,441 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 61 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3216 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:35,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3216 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:03:35,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2024-10-13 12:03:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3079. [2024-10-13 12:03:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3079 states, 2233 states have (on average 2.1065830721003134) internal successors, (4704), 3054 states have internal predecessors, (4704), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:35,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4754 transitions. [2024-10-13 12:03:35,488 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4754 transitions. Word has length 10 [2024-10-13 12:03:35,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:35,488 INFO L471 AbstractCegarLoop]: Abstraction has 3079 states and 4754 transitions. [2024-10-13 12:03:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4754 transitions. [2024-10-13 12:03:35,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 12:03:35,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:35,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:35,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:03:35,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:35,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr662REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:35,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:35,690 INFO L85 PathProgramCache]: Analyzing trace with hash -654195427, now seen corresponding path program 1 times [2024-10-13 12:03:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318403734] [2024-10-13 12:03:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:35,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:35,692 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:35,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:03:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:35,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:03:35,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:35,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:35,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:35,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318403734] [2024-10-13 12:03:35,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318403734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:35,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:35,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:03:35,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549983585] [2024-10-13 12:03:35,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:35,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:35,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:35,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:35,868 INFO L87 Difference]: Start difference. First operand 3079 states and 4754 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:37,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:37,016 INFO L93 Difference]: Finished difference Result 3063 states and 4710 transitions. [2024-10-13 12:03:37,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:03:37,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 12:03:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:37,026 INFO L225 Difference]: With dead ends: 3063 [2024-10-13 12:03:37,027 INFO L226 Difference]: Without dead ends: 3063 [2024-10-13 12:03:37,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:37,027 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 45 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4776 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:37,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4776 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:03:37,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2024-10-13 12:03:37,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2024-10-13 12:03:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3063 states, 2231 states have (on average 2.088749439713133) internal successors, (4660), 3038 states have internal predecessors, (4660), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4710 transitions. [2024-10-13 12:03:37,068 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4710 transitions. Word has length 12 [2024-10-13 12:03:37,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:37,068 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4710 transitions. [2024-10-13 12:03:37,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:37,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4710 transitions. [2024-10-13 12:03:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 12:03:37,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:37,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:37,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:03:37,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:37,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:37,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:37,274 INFO L85 PathProgramCache]: Analyzing trace with hash -20247634, now seen corresponding path program 1 times [2024-10-13 12:03:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111146993] [2024-10-13 12:03:37,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:37,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:37,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:37,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:03:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:37,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:03:37,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:37,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:37,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111146993] [2024-10-13 12:03:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111146993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:03:37,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897344368] [2024-10-13 12:03:37,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:37,450 INFO L87 Difference]: Start difference. First operand 3063 states and 4710 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:38,310 INFO L93 Difference]: Finished difference Result 2949 states and 4470 transitions. [2024-10-13 12:03:38,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:38,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 12:03:38,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:38,317 INFO L225 Difference]: With dead ends: 2949 [2024-10-13 12:03:38,317 INFO L226 Difference]: Without dead ends: 2949 [2024-10-13 12:03:38,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:38,318 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 61 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3100 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:38,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3100 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 12:03:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2024-10-13 12:03:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2024-10-13 12:03:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2141 states have (on average 2.0644558617468474) internal successors, (4420), 2924 states have internal predecessors, (4420), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4470 transitions. [2024-10-13 12:03:38,376 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4470 transitions. Word has length 17 [2024-10-13 12:03:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4470 transitions. [2024-10-13 12:03:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4470 transitions. [2024-10-13 12:03:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 12:03:38,378 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:38,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:38,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:03:38,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:38,579 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:38,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 248617070, now seen corresponding path program 1 times [2024-10-13 12:03:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:38,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139238098] [2024-10-13 12:03:38,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:38,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:38,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:38,585 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:38,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:03:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:38,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:03:38,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:38,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:38,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:38,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139238098] [2024-10-13 12:03:38,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139238098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:38,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:38,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:03:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146139183] [2024-10-13 12:03:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:38,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:03:38,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:38,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:03:38,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:38,804 INFO L87 Difference]: Start difference. First operand 2949 states and 4470 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:39,747 INFO L93 Difference]: Finished difference Result 2895 states and 4390 transitions. [2024-10-13 12:03:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:03:39,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 12:03:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:39,755 INFO L225 Difference]: With dead ends: 2895 [2024-10-13 12:03:39,755 INFO L226 Difference]: Without dead ends: 2895 [2024-10-13 12:03:39,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:03:39,756 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 61 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:39,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 3026 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 12:03:39,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2024-10-13 12:03:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2895. [2024-10-13 12:03:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2111 states have (on average 2.0558976788252012) internal successors, (4340), 2870 states have internal predecessors, (4340), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:39,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4390 transitions. [2024-10-13 12:03:39,789 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4390 transitions. Word has length 17 [2024-10-13 12:03:39,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:39,790 INFO L471 AbstractCegarLoop]: Abstraction has 2895 states and 4390 transitions. [2024-10-13 12:03:39,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:39,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4390 transitions. [2024-10-13 12:03:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:03:39,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:39,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:39,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 12:03:39,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:39,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr348REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:39,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:39,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2016885832, now seen corresponding path program 1 times [2024-10-13 12:03:39,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:39,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2057940980] [2024-10-13 12:03:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:39,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:39,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:40,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:40,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:03:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:40,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:03:40,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:40,220 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:40,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:40,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2057940980] [2024-10-13 12:03:40,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2057940980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:40,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:40,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:03:40,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317670326] [2024-10-13 12:03:40,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:40,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:40,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:40,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:40,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:40,222 INFO L87 Difference]: Start difference. First operand 2895 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:41,408 INFO L93 Difference]: Finished difference Result 2875 states and 4258 transitions. [2024-10-13 12:03:41,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:03:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-13 12:03:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:41,416 INFO L225 Difference]: With dead ends: 2875 [2024-10-13 12:03:41,416 INFO L226 Difference]: Without dead ends: 2875 [2024-10-13 12:03:41,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:41,417 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 45 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:41,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4491 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:03:41,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2024-10-13 12:03:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2875. [2024-10-13 12:03:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2875 states, 2105 states have (on average 1.9990498812351545) internal successors, (4208), 2850 states have internal predecessors, (4208), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4258 transitions. [2024-10-13 12:03:41,481 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4258 transitions. Word has length 19 [2024-10-13 12:03:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:41,481 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4258 transitions. [2024-10-13 12:03:41,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4258 transitions. [2024-10-13 12:03:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 12:03:41,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:41,483 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:41,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 12:03:41,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:41,687 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:41,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:41,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1597166264, now seen corresponding path program 1 times [2024-10-13 12:03:41,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:41,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421320127] [2024-10-13 12:03:41,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:41,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:41,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:41,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:41,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:03:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:41,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:03:41,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:41,886 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:41,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421320127] [2024-10-13 12:03:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421320127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:41,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:41,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:03:41,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893408176] [2024-10-13 12:03:41,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:41,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:41,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:41,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:41,888 INFO L87 Difference]: Start difference. First operand 2875 states and 4258 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:43,177 INFO L93 Difference]: Finished difference Result 2859 states and 4214 transitions. [2024-10-13 12:03:43,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:03:43,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-13 12:03:43,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:43,185 INFO L225 Difference]: With dead ends: 2859 [2024-10-13 12:03:43,185 INFO L226 Difference]: Without dead ends: 2859 [2024-10-13 12:03:43,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:43,186 INFO L432 NwaCegarLoop]: 1482 mSDtfsCounter, 45 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:43,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4428 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 12:03:43,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-13 12:03:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2024-10-13 12:03:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2859 states, 2103 states have (on average 1.9800285306704708) internal successors, (4164), 2834 states have internal predecessors, (4164), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4214 transitions. [2024-10-13 12:03:43,220 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4214 transitions. Word has length 19 [2024-10-13 12:03:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:43,220 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 4214 transitions. [2024-10-13 12:03:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4214 transitions. [2024-10-13 12:03:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:03:43,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:43,223 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] [2024-10-13 12:03:43,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 12:03:43,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:43,424 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr676REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:43,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash -381678773, now seen corresponding path program 1 times [2024-10-13 12:03:43,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132219669] [2024-10-13 12:03:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:43,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:43,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:03:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:43,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:03:43,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:43,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:03:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:43,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:43,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132219669] [2024-10-13 12:03:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132219669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:03:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511259232] [2024-10-13 12:03:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:43,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:43,664 INFO L87 Difference]: Start difference. First operand 2859 states and 4214 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:46,346 INFO L93 Difference]: Finished difference Result 3113 states and 4366 transitions. [2024-10-13 12:03:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:03:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-13 12:03:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:46,351 INFO L225 Difference]: With dead ends: 3113 [2024-10-13 12:03:46,351 INFO L226 Difference]: Without dead ends: 3113 [2024-10-13 12:03:46,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:46,352 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 1489 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1499 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:46,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1499 Valid, 2065 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 12:03:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2024-10-13 12:03:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2855. [2024-10-13 12:03:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2103 states have (on average 1.97622444127437) internal successors, (4156), 2830 states have internal predecessors, (4156), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4206 transitions. [2024-10-13 12:03:46,381 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4206 transitions. Word has length 26 [2024-10-13 12:03:46,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:46,381 INFO L471 AbstractCegarLoop]: Abstraction has 2855 states and 4206 transitions. [2024-10-13 12:03:46,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4206 transitions. [2024-10-13 12:03:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 12:03:46,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:46,382 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] [2024-10-13 12:03:46,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 12:03:46,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:46,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr677REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:46,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -381678772, now seen corresponding path program 1 times [2024-10-13 12:03:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:46,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040893077] [2024-10-13 12:03:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:46,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:46,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:46,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:03:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:46,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:03:46,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:46,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:03:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:46,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:46,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:46,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040893077] [2024-10-13 12:03:46,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040893077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:46,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:46,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:03:46,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416185754] [2024-10-13 12:03:46,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:46,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:46,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:46,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:46,908 INFO L87 Difference]: Start difference. First operand 2855 states and 4206 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:50,665 INFO L93 Difference]: Finished difference Result 3523 states and 4946 transitions. [2024-10-13 12:03:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:03:50,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2024-10-13 12:03:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:50,676 INFO L225 Difference]: With dead ends: 3523 [2024-10-13 12:03:50,676 INFO L226 Difference]: Without dead ends: 3523 [2024-10-13 12:03:50,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:50,677 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 737 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2879 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:50,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2879 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-13 12:03:50,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-10-13 12:03:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2888. [2024-10-13 12:03:50,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2888 states, 2136 states have (on average 1.9634831460674158) internal successors, (4194), 2863 states have internal predecessors, (4194), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:50,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4244 transitions. [2024-10-13 12:03:50,729 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4244 transitions. Word has length 26 [2024-10-13 12:03:50,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:50,729 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4244 transitions. [2024-10-13 12:03:50,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:50,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4244 transitions. [2024-10-13 12:03:50,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:03:50,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:50,730 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] [2024-10-13 12:03:50,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 12:03:50,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:50,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr362REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:50,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:50,933 INFO L85 PathProgramCache]: Analyzing trace with hash -539382154, now seen corresponding path program 1 times [2024-10-13 12:03:50,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849474602] [2024-10-13 12:03:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:50,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:50,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:50,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:50,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:03:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:51,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:03:51,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:51,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:03:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:51,195 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:51,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:51,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849474602] [2024-10-13 12:03:51,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1849474602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:51,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:51,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:03:51,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068550203] [2024-10-13 12:03:51,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:51,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:51,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:51,196 INFO L87 Difference]: Start difference. First operand 2888 states and 4244 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:54,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:54,124 INFO L93 Difference]: Finished difference Result 3541 states and 4945 transitions. [2024-10-13 12:03:54,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:03:54,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:03:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:54,130 INFO L225 Difference]: With dead ends: 3541 [2024-10-13 12:03:54,130 INFO L226 Difference]: Without dead ends: 3541 [2024-10-13 12:03:54,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:54,130 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1526 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 2460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:54,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 3175 Invalid, 2460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 12:03:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2024-10-13 12:03:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2884. [2024-10-13 12:03:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2136 states have (on average 1.952247191011236) internal successors, (4170), 2859 states have internal predecessors, (4170), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4220 transitions. [2024-10-13 12:03:54,159 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4220 transitions. Word has length 33 [2024-10-13 12:03:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:54,159 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4220 transitions. [2024-10-13 12:03:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4220 transitions. [2024-10-13 12:03:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:03:54,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:54,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:03:54,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-13 12:03:54,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:54,361 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr363REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:54,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash -539382153, now seen corresponding path program 1 times [2024-10-13 12:03:54,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:54,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478656681] [2024-10-13 12:03:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:54,362 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:54,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:54,364 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:54,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:03:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:54,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:03:54,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:54,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:03:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:54,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:54,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478656681] [2024-10-13 12:03:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [478656681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:03:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961582462] [2024-10-13 12:03:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:54,694 INFO L87 Difference]: Start difference. First operand 2884 states and 4220 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:03:58,935 INFO L93 Difference]: Finished difference Result 4075 states and 5749 transitions. [2024-10-13 12:03:58,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:03:58,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:03:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:03:58,942 INFO L225 Difference]: With dead ends: 4075 [2024-10-13 12:03:58,943 INFO L226 Difference]: Without dead ends: 4075 [2024-10-13 12:03:58,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:03:58,943 INFO L432 NwaCegarLoop]: 1803 mSDtfsCounter, 1083 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 3806 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 12:03:58,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3806 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 12:03:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2024-10-13 12:03:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2884. [2024-10-13 12:03:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2884 states, 2136 states have (on average 1.948501872659176) internal successors, (4162), 2859 states have internal predecessors, (4162), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:03:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4212 transitions. [2024-10-13 12:03:58,976 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4212 transitions. Word has length 33 [2024-10-13 12:03:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:03:58,976 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4212 transitions. [2024-10-13 12:03:58,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:03:58,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4212 transitions. [2024-10-13 12:03:58,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:03:58,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:03:58,978 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] [2024-10-13 12:03:58,985 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-10-13 12:03:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:59,180 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:03:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:03:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -514220746, now seen corresponding path program 1 times [2024-10-13 12:03:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:03:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173346523] [2024-10-13 12:03:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:03:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:03:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:03:59,188 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:03:59,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:03:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:03:59,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:03:59,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:03:59,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:03:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:03:59,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:03:59,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:03:59,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173346523] [2024-10-13 12:03:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173346523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:03:59,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:03:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:03:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587075836] [2024-10-13 12:03:59,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:03:59,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:03:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:03:59,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:03:59,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:03:59,457 INFO L87 Difference]: Start difference. First operand 2884 states and 4212 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:02,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:02,301 INFO L93 Difference]: Finished difference Result 3521 states and 4913 transitions. [2024-10-13 12:04:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:02,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:04:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:02,306 INFO L225 Difference]: With dead ends: 3521 [2024-10-13 12:04:02,306 INFO L226 Difference]: Without dead ends: 3521 [2024-10-13 12:04:02,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:02,307 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1522 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 3175 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:02,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 3175 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2441 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 12:04:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2024-10-13 12:04:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2880. [2024-10-13 12:04:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2136 states have (on average 1.9447565543071161) internal successors, (4154), 2855 states have internal predecessors, (4154), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:04:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4204 transitions. [2024-10-13 12:04:02,345 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4204 transitions. Word has length 33 [2024-10-13 12:04:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:02,346 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4204 transitions. [2024-10-13 12:04:02,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:02,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4204 transitions. [2024-10-13 12:04:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-13 12:04:02,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:02,348 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:02,354 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-10-13 12:04:02,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:02,552 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:02,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:02,553 INFO L85 PathProgramCache]: Analyzing trace with hash -514220745, now seen corresponding path program 1 times [2024-10-13 12:04:02,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:02,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778335793] [2024-10-13 12:04:02,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:02,553 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:02,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:02,555 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:02,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 12:04:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:02,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:04:02,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:02,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:04:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:02,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:02,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778335793] [2024-10-13 12:04:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778335793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:04:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284376778] [2024-10-13 12:04:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:02,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:02,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:02,859 INFO L87 Difference]: Start difference. First operand 2880 states and 4204 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:07,016 INFO L93 Difference]: Finished difference Result 4067 states and 5733 transitions. [2024-10-13 12:04:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-10-13 12:04:07,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:07,022 INFO L225 Difference]: With dead ends: 4067 [2024-10-13 12:04:07,022 INFO L226 Difference]: Without dead ends: 4067 [2024-10-13 12:04:07,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:07,023 INFO L432 NwaCegarLoop]: 1799 mSDtfsCounter, 1075 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 3771 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:07,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 3771 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 12:04:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-10-13 12:04:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2876. [2024-10-13 12:04:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2136 states have (on average 1.9410112359550562) internal successors, (4146), 2851 states have internal predecessors, (4146), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:04:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4196 transitions. [2024-10-13 12:04:07,053 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4196 transitions. Word has length 33 [2024-10-13 12:04:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:07,053 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4196 transitions. [2024-10-13 12:04:07,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:07,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4196 transitions. [2024-10-13 12:04:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-13 12:04:07,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:07,054 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] [2024-10-13 12:04:07,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-13 12:04:07,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:07,255 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:07,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1343686139, now seen corresponding path program 1 times [2024-10-13 12:04:07,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:07,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580383178] [2024-10-13 12:04:07,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:07,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:07,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:07,257 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:07,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 12:04:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:07,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:07,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:07,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:07,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:07,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580383178] [2024-10-13 12:04:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580383178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:07,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:07,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157146409] [2024-10-13 12:04:07,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:07,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:07,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:07,462 INFO L87 Difference]: Start difference. First operand 2876 states and 4196 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:08,561 INFO L93 Difference]: Finished difference Result 2864 states and 4172 transitions. [2024-10-13 12:04:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:04:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-10-13 12:04:08,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:08,565 INFO L225 Difference]: With dead ends: 2864 [2024-10-13 12:04:08,565 INFO L226 Difference]: Without dead ends: 2864 [2024-10-13 12:04:08,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:08,566 INFO L432 NwaCegarLoop]: 1468 mSDtfsCounter, 21 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4381 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:08,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4381 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:04:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2024-10-13 12:04:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864. [2024-10-13 12:04:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2124 states have (on average 1.9406779661016949) internal successors, (4122), 2839 states have internal predecessors, (4122), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 12:04:08,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4172 transitions. [2024-10-13 12:04:08,600 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4172 transitions. Word has length 40 [2024-10-13 12:04:08,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:08,600 INFO L471 AbstractCegarLoop]: Abstraction has 2864 states and 4172 transitions. [2024-10-13 12:04:08,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:08,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4172 transitions. [2024-10-13 12:04:08,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-13 12:04:08,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:08,602 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] [2024-10-13 12:04:08,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-10-13 12:04:08,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:08,803 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr684REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:08,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 2088153858, now seen corresponding path program 1 times [2024-10-13 12:04:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:08,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600312505] [2024-10-13 12:04:08,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:08,809 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:08,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 12:04:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:09,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:09,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:09,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:09,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:09,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:09,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600312505] [2024-10-13 12:04:09,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600312505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:04:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695841597] [2024-10-13 12:04:09,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:09,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:09,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:09,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:09,159 INFO L87 Difference]: Start difference. First operand 2864 states and 4172 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:10,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:10,516 INFO L93 Difference]: Finished difference Result 4172 states and 5857 transitions. [2024-10-13 12:04:10,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:10,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2024-10-13 12:04:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:10,522 INFO L225 Difference]: With dead ends: 4172 [2024-10-13 12:04:10,522 INFO L226 Difference]: Without dead ends: 4172 [2024-10-13 12:04:10,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:10,523 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 1014 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:10,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2906 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 12:04:10,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2024-10-13 12:04:10,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 3536. [2024-10-13 12:04:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3536 states, 2792 states have (on average 1.9255014326647564) internal successors, (5376), 3504 states have internal predecessors, (5376), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 12:04:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 5440 transitions. [2024-10-13 12:04:10,592 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 5440 transitions. Word has length 44 [2024-10-13 12:04:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:10,592 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 5440 transitions. [2024-10-13 12:04:10,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 5440 transitions. [2024-10-13 12:04:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 12:04:10,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:10,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:10,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-13 12:04:10,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:10,795 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:10,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:10,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1373428208, now seen corresponding path program 1 times [2024-10-13 12:04:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:10,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352732327] [2024-10-13 12:04:10,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:10,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:10,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:10,798 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:10,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 12:04:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:11,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:11,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:11,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:11,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352732327] [2024-10-13 12:04:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352732327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176640967] [2024-10-13 12:04:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:11,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:11,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:11,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:11,121 INFO L87 Difference]: Start difference. First operand 3536 states and 5440 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:12,244 INFO L93 Difference]: Finished difference Result 3494 states and 5370 transitions. [2024-10-13 12:04:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:04:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-13 12:04:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:12,250 INFO L225 Difference]: With dead ends: 3494 [2024-10-13 12:04:12,250 INFO L226 Difference]: Without dead ends: 3494 [2024-10-13 12:04:12,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:12,251 INFO L432 NwaCegarLoop]: 1464 mSDtfsCounter, 21 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 4369 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:12,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4369 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:04:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-13 12:04:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2024-10-13 12:04:12,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3494 states, 2750 states have (on average 1.9294545454545455) internal successors, (5306), 3462 states have internal predecessors, (5306), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 12:04:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5370 transitions. [2024-10-13 12:04:12,290 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5370 transitions. Word has length 49 [2024-10-13 12:04:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:12,290 INFO L471 AbstractCegarLoop]: Abstraction has 3494 states and 5370 transitions. [2024-10-13 12:04:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5370 transitions. [2024-10-13 12:04:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-13 12:04:12,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:12,292 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:12,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-13 12:04:12,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:12,493 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:12,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:12,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1443981237, now seen corresponding path program 1 times [2024-10-13 12:04:12,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:12,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583055636] [2024-10-13 12:04:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:12,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:12,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:12,497 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:12,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 12:04:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:12,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:12,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:12,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:12,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583055636] [2024-10-13 12:04:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583055636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:12,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176562151] [2024-10-13 12:04:12,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:12,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:12,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:12,816 INFO L87 Difference]: Start difference. First operand 3494 states and 5370 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:13,940 INFO L93 Difference]: Finished difference Result 3476 states and 5340 transitions. [2024-10-13 12:04:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:04:13,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-13 12:04:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:13,945 INFO L225 Difference]: With dead ends: 3476 [2024-10-13 12:04:13,945 INFO L226 Difference]: Without dead ends: 3476 [2024-10-13 12:04:13,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:13,945 INFO L432 NwaCegarLoop]: 1460 mSDtfsCounter, 15 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4363 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:13,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4363 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 12:04:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2024-10-13 12:04:13,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3476. [2024-10-13 12:04:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 2732 states have (on average 1.9311859443631039) internal successors, (5276), 3444 states have internal predecessors, (5276), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 12:04:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5340 transitions. [2024-10-13 12:04:14,002 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5340 transitions. Word has length 52 [2024-10-13 12:04:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:14,002 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5340 transitions. [2024-10-13 12:04:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5340 transitions. [2024-10-13 12:04:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-13 12:04:14,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:14,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:14,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-13 12:04:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:14,204 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:14,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2083281976, now seen corresponding path program 1 times [2024-10-13 12:04:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:14,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974650924] [2024-10-13 12:04:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:14,206 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:14,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 12:04:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:14,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:04:14,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:14,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:04:14,465 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:04:14,467 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-10-13 12:04:14,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:04:14,498 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-10-13 12:04:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:14,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:14,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:14,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974650924] [2024-10-13 12:04:14,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974650924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:14,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:14,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:14,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093576889] [2024-10-13 12:04:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:14,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:14,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:14,526 INFO L87 Difference]: Start difference. First operand 3476 states and 5340 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:17,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:17,118 INFO L93 Difference]: Finished difference Result 4728 states and 7149 transitions. [2024-10-13 12:04:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:17,119 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-10-13 12:04:17,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:17,125 INFO L225 Difference]: With dead ends: 4728 [2024-10-13 12:04:17,125 INFO L226 Difference]: Without dead ends: 4728 [2024-10-13 12:04:17,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:17,129 INFO L432 NwaCegarLoop]: 1591 mSDtfsCounter, 1535 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 3965 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:17,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 3965 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 12:04:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2024-10-13 12:04:17,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 3445. [2024-10-13 12:04:17,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3445 states, 2701 states have (on average 1.941503146982599) internal successors, (5244), 3413 states have internal predecessors, (5244), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 12:04:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 5308 transitions. [2024-10-13 12:04:17,171 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 5308 transitions. Word has length 55 [2024-10-13 12:04:17,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:17,171 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 5308 transitions. [2024-10-13 12:04:17,171 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:17,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 5308 transitions. [2024-10-13 12:04:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 12:04:17,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:17,171 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-10-13 12:04:17,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-13 12:04:17,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:17,372 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr427REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:17,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2106413678, now seen corresponding path program 1 times [2024-10-13 12:04:17,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850453227] [2024-10-13 12:04:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:17,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:17,374 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:17,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-13 12:04:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:17,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:17,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:17,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:17,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:17,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:17,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850453227] [2024-10-13 12:04:17,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850453227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:17,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:17,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:04:17,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599757680] [2024-10-13 12:04:17,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:17,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:04:17,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:17,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:04:17,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:17,790 INFO L87 Difference]: Start difference. First operand 3445 states and 5308 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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-10-13 12:04:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:18,872 INFO L93 Difference]: Finished difference Result 4570 states and 6768 transitions. [2024-10-13 12:04:18,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:04:18,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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-10-13 12:04:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:18,878 INFO L225 Difference]: With dead ends: 4570 [2024-10-13 12:04:18,878 INFO L226 Difference]: Without dead ends: 4570 [2024-10-13 12:04:18,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:04:18,879 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 721 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:18,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2961 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 12:04:18,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2024-10-13 12:04:18,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 4234. [2024-10-13 12:04:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4234 states, 3484 states have (on average 1.9153272101033294) internal successors, (6673), 4193 states have internal predecessors, (6673), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-13 12:04:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 6755 transitions. [2024-10-13 12:04:18,917 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 6755 transitions. Word has length 53 [2024-10-13 12:04:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:18,917 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 6755 transitions. [2024-10-13 12:04:18,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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-10-13 12:04:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 6755 transitions. [2024-10-13 12:04:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 12:04:18,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:18,917 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] [2024-10-13 12:04:18,924 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 (24)] Ended with exit code 0 [2024-10-13 12:04:19,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:19,122 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:19,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:19,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1490723271, now seen corresponding path program 1 times [2024-10-13 12:04:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423418605] [2024-10-13 12:04:19,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:19,126 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:19,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-10-13 12:04:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:19,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:04:19,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:19,446 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:04:19,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:04:19,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:04:19,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 12:04:19,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:04:19,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 12:04:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:19,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:19,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423418605] [2024-10-13 12:04:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423418605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:19,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:19,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:19,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902532298] [2024-10-13 12:04:19,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:19,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:19,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:19,572 INFO L87 Difference]: Start difference. First operand 4234 states and 6755 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:21,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:21,267 INFO L93 Difference]: Finished difference Result 4551 states and 6834 transitions. [2024-10-13 12:04:21,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:21,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-10-13 12:04:21,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:21,272 INFO L225 Difference]: With dead ends: 4551 [2024-10-13 12:04:21,272 INFO L226 Difference]: Without dead ends: 4551 [2024-10-13 12:04:21,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:21,273 INFO L432 NwaCegarLoop]: 1467 mSDtfsCounter, 770 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:21,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 4333 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 12:04:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2024-10-13 12:04:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 3866. [2024-10-13 12:04:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3866 states, 3116 states have (on average 1.9409499358151476) internal successors, (6048), 3828 states have internal predecessors, (6048), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 12:04:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 6124 transitions. [2024-10-13 12:04:21,357 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 6124 transitions. Word has length 56 [2024-10-13 12:04:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:21,357 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 6124 transitions. [2024-10-13 12:04:21,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 6124 transitions. [2024-10-13 12:04:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-13 12:04:21,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:21,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:21,377 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 (25)] Ended with exit code 0 [2024-10-13 12:04:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:21,559 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1155902858, now seen corresponding path program 1 times [2024-10-13 12:04:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516008139] [2024-10-13 12:04:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:21,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:21,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:21,561 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:21,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-10-13 12:04:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:21,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:04:21,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:21,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:04:21,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 5 [2024-10-13 12:04:22,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:04:22,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:04:22,284 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:04:22,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:04:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:22,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:22,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:22,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516008139] [2024-10-13 12:04:22,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516008139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:22,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:22,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:04:22,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723005600] [2024-10-13 12:04:22,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:22,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:22,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:22,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:22,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:22,297 INFO L87 Difference]: Start difference. First operand 3866 states and 6124 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:24,651 INFO L93 Difference]: Finished difference Result 3782 states and 5881 transitions. [2024-10-13 12:04:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:04:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2024-10-13 12:04:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:24,655 INFO L225 Difference]: With dead ends: 3782 [2024-10-13 12:04:24,656 INFO L226 Difference]: Without dead ends: 3782 [2024-10-13 12:04:24,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:24,656 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 2898 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2908 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:24,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 507 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 12:04:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2024-10-13 12:04:24,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3672. [2024-10-13 12:04:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 3006 states have (on average 1.855954757152362) internal successors, (5579), 3634 states have internal predecessors, (5579), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 12:04:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5655 transitions. [2024-10-13 12:04:24,686 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5655 transitions. Word has length 56 [2024-10-13 12:04:24,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:24,686 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5655 transitions. [2024-10-13 12:04:24,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5655 transitions. [2024-10-13 12:04:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:04:24,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:24,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:24,695 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 (26)] Ended with exit code 0 [2024-10-13 12:04:24,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:24,887 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:24,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2001067946, now seen corresponding path program 1 times [2024-10-13 12:04:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925356926] [2024-10-13 12:04:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:24,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:24,890 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:24,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-10-13 12:04:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:25,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:04:25,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:25,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:04:25,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:04:25,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 12:04:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:25,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:25,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925356926] [2024-10-13 12:04:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925356926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:25,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:25,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:25,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248737992] [2024-10-13 12:04:25,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:04:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:25,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:04:25,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:25,218 INFO L87 Difference]: Start difference. First operand 3672 states and 5655 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:28,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:28,265 INFO L93 Difference]: Finished difference Result 3671 states and 5652 transitions. [2024-10-13 12:04:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:04:28,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-13 12:04:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:28,270 INFO L225 Difference]: With dead ends: 3671 [2024-10-13 12:04:28,270 INFO L226 Difference]: Without dead ends: 3671 [2024-10-13 12:04:28,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:04:28,271 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 2 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:28,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3831 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-13 12:04:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-10-13 12:04:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2024-10-13 12:04:28,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3671 states, 3006 states have (on average 1.854956753160346) internal successors, (5576), 3633 states have internal predecessors, (5576), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 12:04:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5652 transitions. [2024-10-13 12:04:28,303 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5652 transitions. Word has length 60 [2024-10-13 12:04:28,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:28,304 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 5652 transitions. [2024-10-13 12:04:28,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5652 transitions. [2024-10-13 12:04:28,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 12:04:28,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:28,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:04:28,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2024-10-13 12:04:28,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:28,505 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:28,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:28,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2001067945, now seen corresponding path program 1 times [2024-10-13 12:04:28,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:28,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123275036] [2024-10-13 12:04:28,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:28,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:28,509 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:28,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-10-13 12:04:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:28,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 12:04:28,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:28,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:04:28,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 12:04:28,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 12:04:28,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 12:04:28,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:28,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:28,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:28,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123275036] [2024-10-13 12:04:28,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123275036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:28,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:28,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:28,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877499294] [2024-10-13 12:04:28,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:28,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:04:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:28,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:04:28,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:04:28,861 INFO L87 Difference]: Start difference. First operand 3671 states and 5652 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:32,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 12:04:32,907 INFO L93 Difference]: Finished difference Result 3670 states and 5649 transitions. [2024-10-13 12:04:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:04:32,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-10-13 12:04:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 12:04:32,913 INFO L225 Difference]: With dead ends: 3670 [2024-10-13 12:04:32,913 INFO L226 Difference]: Without dead ends: 3670 [2024-10-13 12:04:32,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:04:32,913 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 1 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3781 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-13 12:04:32,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3781 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-13 12:04:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2024-10-13 12:04:32,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3670. [2024-10-13 12:04:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 3003 states have (on average 1.855810855810856) internal successors, (5573), 3632 states have internal predecessors, (5573), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-13 12:04:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 5649 transitions. [2024-10-13 12:04:32,968 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 5649 transitions. Word has length 60 [2024-10-13 12:04:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 12:04:32,969 INFO L471 AbstractCegarLoop]: Abstraction has 3670 states and 5649 transitions. [2024-10-13 12:04:32,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:04:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 5649 transitions. [2024-10-13 12:04:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 12:04:32,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 12:04:32,969 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-10-13 12:04:32,978 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 (28)] Ended with exit code 0 [2024-10-13 12:04:33,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:33,170 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-13 12:04:33,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:04:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 952989978, now seen corresponding path program 1 times [2024-10-13 12:04:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:04:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639213786] [2024-10-13 12:04:33,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:04:33,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:04:33,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:04:33,173 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:04:33,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-10-13 12:04:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:04:33,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:04:33,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:04:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:04:33,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:04:33,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:04:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639213786] [2024-10-13 12:04:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639213786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:04:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:04:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:04:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329130952] [2024-10-13 12:04:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:04:33,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:04:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:04:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:04:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:04:33,470 INFO L87 Difference]: Start difference. First operand 3670 states and 5649 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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)