./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 61a67961 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-wip.fs.cvc5-61a6796-m [2024-10-14 19:17:52,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:17:53,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:17:53,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:17:53,024 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:17:53,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:17:53,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:17:53,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:17:53,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:17:53,049 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:17:53,049 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:17:53,050 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:17:53,050 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:17:53,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:17:53,052 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:17:53,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:17:53,052 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:17:53,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:17:53,053 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:17:53,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:17:53,053 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:17:53,056 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:17:53,056 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:17:53,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:17:53,057 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:17:53,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:17:53,057 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:17:53,057 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:17:53,057 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:17:53,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:17:53,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:17:53,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:17:53,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:17:53,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:17:53,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:17:53,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:17:53,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:17:53,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:17:53,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:17:53,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:17:53,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:17:53,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:17:53,060 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-14 19:17:53,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:17:53,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:17:53,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:17:53,259 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:17:53,259 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:17:53,260 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-14 19:17:54,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:17:54,690 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:17:54,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-14 19:17:54,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a892487/41f65b6e61214941baabb5140bf41423/FLAGfc0d3f18b [2024-10-14 19:17:55,011 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a892487/41f65b6e61214941baabb5140bf41423 [2024-10-14 19:17:55,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:17:55,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:17:55,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:55,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:17:55,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:17:55,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:55" (1/1) ... [2024-10-14 19:17:55,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58eb10ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:55, skipping insertion in model container [2024-10-14 19:17:55,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:55" (1/1) ... [2024-10-14 19:17:55,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:17:55,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:55,540 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-14 19:17:55,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@656f2268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:55, skipping insertion in model container [2024-10-14 19:17:55,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:55,541 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:17:55,542 INFO L158 Benchmark]: Toolchain (without parser) took 527.49ms. Allocated memory is still 138.4MB. Free memory was 87.7MB in the beginning and 57.9MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 19:17:55,543 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 138.4MB. Free memory was 101.0MB in the beginning and 100.8MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:17:55,543 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.98ms. Allocated memory is still 138.4MB. Free memory was 87.7MB in the beginning and 57.9MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 19:17:55,544 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.13ms. Allocated memory is still 138.4MB. Free memory was 101.0MB in the beginning and 100.8MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.98ms. Allocated memory is still 138.4MB. Free memory was 87.7MB in the beginning and 57.9MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. 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-wip.fs.cvc5-61a6796-m [2024-10-14 19:17:57,068 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:17:57,125 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:17:57,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:17:57,130 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:17:57,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:17:57,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:17:57,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:17:57,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:17:57,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:17:57,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:17:57,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:17:57,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:17:57,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:17:57,160 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:17:57,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:17:57,160 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:17:57,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:17:57,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:17:57,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:17:57,160 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:17:57,163 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:17:57,163 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:17:57,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:17:57,163 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:17:57,163 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:17:57,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:17:57,164 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:17:57,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:17:57,164 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:17:57,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:17:57,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:17:57,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:17:57,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:17:57,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:17:57,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:17:57,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:17:57,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:17:57,167 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:17:57,168 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-14 19:17:57,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:17:57,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:17:57,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:17:57,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:17:57,426 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:17:57,427 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-14 19:17:58,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:17:58,906 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:17:58,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2024-10-14 19:17:58,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e440b752c/eb3fe15bd0c7410baba770d6bb536b1f/FLAG3dda01b9a [2024-10-14 19:17:58,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e440b752c/eb3fe15bd0c7410baba770d6bb536b1f [2024-10-14 19:17:58,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:17:58,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:17:58,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:58,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:17:58,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:17:58,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:58" (1/1) ... [2024-10-14 19:17:58,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425e896c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:58, skipping insertion in model container [2024-10-14 19:17:58,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:17:58" (1/1) ... [2024-10-14 19:17:59,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:17:59,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:59,494 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:17:59,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:17:59,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:59,604 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:17:59,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:17:59,719 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:17:59,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59 WrapperNode [2024-10-14 19:17:59,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:17:59,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:17:59,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:17:59,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:17:59,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:17:59,760 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:17:59,839 INFO L138 Inliner]: procedures = 180, calls = 507, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2272 [2024-10-14 19:17:59,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:17:59,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:17:59,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:17:59,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:17:59,849 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:17:59,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:17:59,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:17:59,937 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 106, 372]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 4, 82]. [2024-10-14 19:17:59,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:17:59,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:18:00,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:18:00,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:18:00,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:18:00,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:18:00,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:18:00,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:18:00,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:18:00,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:18:00,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (1/1) ... [2024-10-14 19:18:00,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:18:00,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:18:00,076 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-14 19:18:00,080 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-14 19:18:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:18:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:18:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:18:00,111 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-14 19:18:00,111 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-14 19:18:00,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:18:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:18:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:18:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 19:18:00,113 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 19:18:00,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:18:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:18:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:18:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:18:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:18:00,114 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:18:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:18:00,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:18:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:18:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:18:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:18:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:18:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:18:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:18:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:18:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:18:00,345 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:18:00,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:18:00,396 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:18:00,414 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:18:00,429 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:18:05,142 INFO L? ?]: Removed 2009 outVars from TransFormulas that were not future-live. [2024-10-14 19:18:05,143 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:18:05,333 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:18:05,334 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-14 19:18:05,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:18:05 BoogieIcfgContainer [2024-10-14 19:18:05,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:18:05,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:18:05,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:18:05,339 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:18:05,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:17:58" (1/3) ... [2024-10-14 19:18:05,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540d05d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:18:05, skipping insertion in model container [2024-10-14 19:18:05,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:17:59" (2/3) ... [2024-10-14 19:18:05,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540d05d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:18:05, skipping insertion in model container [2024-10-14 19:18:05,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:18:05" (3/3) ... [2024-10-14 19:18:05,342 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2024-10-14 19:18:05,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:18:05,355 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 986 error locations. [2024-10-14 19:18:05,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:18:05,414 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;@8076ea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:18:05,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 986 error locations. [2024-10-14 19:18:05,421 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-14 19:18:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:18:05,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:05,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:18:05,426 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-14 19:18:05,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash 110388, now seen corresponding path program 1 times [2024-10-14 19:18:05,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:05,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280815689] [2024-10-14 19:18:05,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:05,439 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-14 19:18:05,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:05,442 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-14 19:18:05,443 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-14 19:18:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:05,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:05,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:05,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:18:05,640 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-14 19:18:05,640 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:05,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280815689] [2024-10-14 19:18:05,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280815689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:18:05,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468595123] [2024-10-14 19:18:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:05,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:05,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:05,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:05,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:05,706 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-14 19:18:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:08,079 INFO L93 Difference]: Finished difference Result 2312 states and 2476 transitions. [2024-10-14 19:18:08,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:08,081 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-14 19:18:08,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:08,098 INFO L225 Difference]: With dead ends: 2312 [2024-10-14 19:18:08,098 INFO L226 Difference]: Without dead ends: 2311 [2024-10-14 19:18:08,099 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-14 19:18:08,102 INFO L432 NwaCegarLoop]: 1063 mSDtfsCounter, 1769 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:08,103 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.3s Time] [2024-10-14 19:18:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2024-10-14 19:18:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 1986. [2024-10-14 19:18:08,183 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-14 19:18:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2308 transitions. [2024-10-14 19:18:08,189 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2308 transitions. Word has length 2 [2024-10-14 19:18:08,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:08,189 INFO L471 AbstractCegarLoop]: Abstraction has 1986 states and 2308 transitions. [2024-10-14 19:18:08,189 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-14 19:18:08,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2308 transitions. [2024-10-14 19:18:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:18:08,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:08,190 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:18:08,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:08,392 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-14 19:18:08,393 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-14 19:18:08,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash 110389, now seen corresponding path program 1 times [2024-10-14 19:18:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:08,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737761777] [2024-10-14 19:18:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:08,394 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-14 19:18:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:08,395 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-14 19:18:08,396 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-14 19:18:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:08,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:08,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:08,537 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-14 19:18:08,543 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-14 19:18:08,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:08,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:08,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737761777] [2024-10-14 19:18:08,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737761777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:08,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:18:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875718172] [2024-10-14 19:18:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:08,546 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-14 19:18:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:11,551 INFO L93 Difference]: Finished difference Result 2711 states and 3113 transitions. [2024-10-14 19:18:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:11,552 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-14 19:18:11,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:11,558 INFO L225 Difference]: With dead ends: 2711 [2024-10-14 19:18:11,559 INFO L226 Difference]: Without dead ends: 2711 [2024-10-14 19:18:11,559 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-14 19:18:11,560 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 799 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:11,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 2504 Invalid, 1461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 19:18:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2024-10-14 19:18:11,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 2383. [2024-10-14 19:18:11,585 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-14 19:18:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3113 transitions. [2024-10-14 19:18:11,590 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3113 transitions. Word has length 2 [2024-10-14 19:18:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:11,590 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 3113 transitions. [2024-10-14 19:18:11,590 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-14 19:18:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3113 transitions. [2024-10-14 19:18:11,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:18:11,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:11,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:18:11,593 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-14 19:18:11,792 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-14 19:18:11,793 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-14 19:18:11,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1132525186, now seen corresponding path program 1 times [2024-10-14 19:18:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:11,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206502404] [2024-10-14 19:18:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:11,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:18:11,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:11,795 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-14 19:18:11,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:18:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:11,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:18:11,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:11,931 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-14 19:18:11,937 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-14 19:18:11,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:18:11,996 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-14 19:18:12,010 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:18:12,010 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-14 19:18:12,029 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-14 19:18:12,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:12,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206502404] [2024-10-14 19:18:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206502404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953914270] [2024-10-14 19:18:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:12,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:12,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:12,033 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-14 19:18:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:17,538 INFO L93 Difference]: Finished difference Result 4425 states and 5305 transitions. [2024-10-14 19:18:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:17,538 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-14 19:18:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:17,548 INFO L225 Difference]: With dead ends: 4425 [2024-10-14 19:18:17,548 INFO L226 Difference]: Without dead ends: 4425 [2024-10-14 19:18:17,548 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-14 19:18:17,550 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 2161 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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, 5.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:17,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2170 Valid, 2091 Invalid, 3864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-14 19:18:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4425 states. [2024-10-14 19:18:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4425 to 2957. [2024-10-14 19:18:17,591 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-14 19:18:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2957 states to 2957 states and 4485 transitions. [2024-10-14 19:18:17,599 INFO L78 Accepts]: Start accepts. Automaton has 2957 states and 4485 transitions. Word has length 6 [2024-10-14 19:18:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:17,601 INFO L471 AbstractCegarLoop]: Abstraction has 2957 states and 4485 transitions. [2024-10-14 19:18:17,601 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-14 19:18:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2957 states and 4485 transitions. [2024-10-14 19:18:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:18:17,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:17,602 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:17,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:18:17,802 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-14 19:18:17,803 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-14 19:18:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash -748542378, now seen corresponding path program 1 times [2024-10-14 19:18:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:17,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189088671] [2024-10-14 19:18:17,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:17,804 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-14 19:18:17,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:17,807 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-14 19:18:17,807 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-14 19:18:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:17,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:17,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:17,949 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-14 19:18:17,958 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-14 19:18:17,958 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:17,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:17,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189088671] [2024-10-14 19:18:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189088671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:17,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:17,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932692963] [2024-10-14 19:18:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:17,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:17,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:17,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:17,960 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-14 19:18:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:20,004 INFO L93 Difference]: Finished difference Result 3593 states and 5079 transitions. [2024-10-14 19:18:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:20,004 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-14 19:18:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:20,014 INFO L225 Difference]: With dead ends: 3593 [2024-10-14 19:18:20,015 INFO L226 Difference]: Without dead ends: 3593 [2024-10-14 19:18:20,015 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-14 19:18:20,017 INFO L432 NwaCegarLoop]: 1662 mSDtfsCounter, 1726 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:20,019 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.0s Time] [2024-10-14 19:18:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-10-14 19:18:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 2865. [2024-10-14 19:18:20,069 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-14 19:18:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2865 states to 2865 states and 4270 transitions. [2024-10-14 19:18:20,075 INFO L78 Accepts]: Start accepts. Automaton has 2865 states and 4270 transitions. Word has length 7 [2024-10-14 19:18:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:20,075 INFO L471 AbstractCegarLoop]: Abstraction has 2865 states and 4270 transitions. [2024-10-14 19:18:20,075 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-14 19:18:20,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2865 states and 4270 transitions. [2024-10-14 19:18:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:18:20,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:20,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:20,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:20,281 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-14 19:18:20,281 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-14 19:18:20,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash -748542377, now seen corresponding path program 1 times [2024-10-14 19:18:20,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:20,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631144881] [2024-10-14 19:18:20,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:20,282 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-14 19:18:20,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:20,284 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-14 19:18:20,285 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-14 19:18:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:20,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:20,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:20,420 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-14 19:18:20,437 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-14 19:18:20,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:20,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:20,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631144881] [2024-10-14 19:18:20,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631144881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:20,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:20,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:20,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040149991] [2024-10-14 19:18:20,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:20,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:20,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:20,438 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-14 19:18:23,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:23,321 INFO L93 Difference]: Finished difference Result 4436 states and 6495 transitions. [2024-10-14 19:18:23,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:23,322 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-14 19:18:23,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:23,331 INFO L225 Difference]: With dead ends: 4436 [2024-10-14 19:18:23,331 INFO L226 Difference]: Without dead ends: 4436 [2024-10-14 19:18:23,331 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-14 19:18:23,332 INFO L432 NwaCegarLoop]: 1961 mSDtfsCounter, 1287 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:23,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 2788 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 19:18:23,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4436 states. [2024-10-14 19:18:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4436 to 3133. [2024-10-14 19:18:23,364 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-14 19:18:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 4834 transitions. [2024-10-14 19:18:23,371 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 4834 transitions. Word has length 7 [2024-10-14 19:18:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 4834 transitions. [2024-10-14 19:18:23,371 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-14 19:18:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 4834 transitions. [2024-10-14 19:18:23,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 19:18:23,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:23,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:23,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-14 19:18:23,572 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-14 19:18:23,573 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-14 19:18:23,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:23,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1658779517, now seen corresponding path program 1 times [2024-10-14 19:18:23,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:23,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322393528] [2024-10-14 19:18:23,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:23,573 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-14 19:18:23,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:23,574 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-14 19:18:23,575 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-14 19:18:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:23,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:18:23,684 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:23,690 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-14 19:18:23,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:23,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:23,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322393528] [2024-10-14 19:18:23,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322393528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:23,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:23,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:23,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363480406] [2024-10-14 19:18:23,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:23,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:23,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:23,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:23,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:23,691 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-14 19:18:24,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:24,403 INFO L93 Difference]: Finished difference Result 3079 states and 4754 transitions. [2024-10-14 19:18:24,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:24,403 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-14 19:18:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:24,410 INFO L225 Difference]: With dead ends: 3079 [2024-10-14 19:18:24,410 INFO L226 Difference]: Without dead ends: 3079 [2024-10-14 19:18:24,410 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-14 19:18:24,410 INFO L432 NwaCegarLoop]: 1629 mSDtfsCounter, 61 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:24,410 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.7s Time] [2024-10-14 19:18:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3079 states. [2024-10-14 19:18:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3079 to 3079. [2024-10-14 19:18:24,435 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-14 19:18:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3079 states to 3079 states and 4754 transitions. [2024-10-14 19:18:24,439 INFO L78 Accepts]: Start accepts. Automaton has 3079 states and 4754 transitions. Word has length 10 [2024-10-14 19:18:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:24,439 INFO L471 AbstractCegarLoop]: Abstraction has 3079 states and 4754 transitions. [2024-10-14 19:18:24,440 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-14 19:18:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3079 states and 4754 transitions. [2024-10-14 19:18:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:18:24,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:24,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:24,444 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-14 19:18:24,640 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-14 19:18:24,641 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-14 19:18:24,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:24,641 INFO L85 PathProgramCache]: Analyzing trace with hash -654195427, now seen corresponding path program 1 times [2024-10-14 19:18:24,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:24,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078521932] [2024-10-14 19:18:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:24,641 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-14 19:18:24,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:24,642 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-14 19:18:24,643 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-14 19:18:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:24,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:24,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:24,769 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-14 19:18:24,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:24,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078521932] [2024-10-14 19:18:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078521932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:24,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611738644] [2024-10-14 19:18:24,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:24,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:24,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:24,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:24,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:24,771 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-14 19:18:25,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:25,667 INFO L93 Difference]: Finished difference Result 3063 states and 4710 transitions. [2024-10-14 19:18:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:25,668 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-14 19:18:25,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:25,674 INFO L225 Difference]: With dead ends: 3063 [2024-10-14 19:18:25,674 INFO L226 Difference]: Without dead ends: 3063 [2024-10-14 19:18:25,675 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-14 19:18:25,675 INFO L432 NwaCegarLoop]: 1598 mSDtfsCounter, 45 mSDsluCounter, 3178 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:25,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4776 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:18:25,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2024-10-14 19:18:25,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 3063. [2024-10-14 19:18:25,700 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-14 19:18:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3063 states to 3063 states and 4710 transitions. [2024-10-14 19:18:25,704 INFO L78 Accepts]: Start accepts. Automaton has 3063 states and 4710 transitions. Word has length 12 [2024-10-14 19:18:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:25,705 INFO L471 AbstractCegarLoop]: Abstraction has 3063 states and 4710 transitions. [2024-10-14 19:18:25,705 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-14 19:18:25,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3063 states and 4710 transitions. [2024-10-14 19:18:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:18:25,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:25,706 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:25,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 19:18:25,906 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-14 19:18:25,907 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-14 19:18:25,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:25,908 INFO L85 PathProgramCache]: Analyzing trace with hash -20247634, now seen corresponding path program 1 times [2024-10-14 19:18:25,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:25,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742225222] [2024-10-14 19:18:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:25,908 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-14 19:18:25,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:25,912 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-14 19:18:25,912 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-14 19:18:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:26,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:18:26,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:26,083 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-14 19:18:26,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:26,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:26,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742225222] [2024-10-14 19:18:26,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [742225222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:26,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:26,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:26,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957470595] [2024-10-14 19:18:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:26,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:26,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:26,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:26,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:26,085 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-14 19:18:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:26,743 INFO L93 Difference]: Finished difference Result 2949 states and 4470 transitions. [2024-10-14 19:18:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:26,743 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-14 19:18:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:26,749 INFO L225 Difference]: With dead ends: 2949 [2024-10-14 19:18:26,749 INFO L226 Difference]: Without dead ends: 2949 [2024-10-14 19:18:26,749 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-14 19:18:26,750 INFO L432 NwaCegarLoop]: 1571 mSDtfsCounter, 61 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:26,750 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.6s Time] [2024-10-14 19:18:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2949 states. [2024-10-14 19:18:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949. [2024-10-14 19:18:26,771 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-14 19:18:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4470 transitions. [2024-10-14 19:18:26,774 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4470 transitions. Word has length 17 [2024-10-14 19:18:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4470 transitions. [2024-10-14 19:18:26,775 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-14 19:18:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4470 transitions. [2024-10-14 19:18:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:18:26,775 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:26,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:18:26,780 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-14 19:18:26,976 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-14 19:18:26,976 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-14 19:18:26,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:26,977 INFO L85 PathProgramCache]: Analyzing trace with hash 248617070, now seen corresponding path program 1 times [2024-10-14 19:18:26,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:26,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287184758] [2024-10-14 19:18:26,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:26,977 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-14 19:18:26,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:26,981 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-14 19:18:26,982 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-14 19:18:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:27,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:18:27,135 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:27,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:27,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287184758] [2024-10-14 19:18:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1287184758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984894131] [2024-10-14 19:18:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:27,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:27,145 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-14 19:18:27,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:27,834 INFO L93 Difference]: Finished difference Result 2895 states and 4390 transitions. [2024-10-14 19:18:27,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:27,835 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-14 19:18:27,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:27,839 INFO L225 Difference]: With dead ends: 2895 [2024-10-14 19:18:27,839 INFO L226 Difference]: Without dead ends: 2895 [2024-10-14 19:18:27,839 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-14 19:18:27,839 INFO L432 NwaCegarLoop]: 1534 mSDtfsCounter, 61 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:27,840 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.7s Time] [2024-10-14 19:18:27,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2024-10-14 19:18:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2895. [2024-10-14 19:18:27,863 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-14 19:18:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 4390 transitions. [2024-10-14 19:18:27,868 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 4390 transitions. Word has length 17 [2024-10-14 19:18:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:27,868 INFO L471 AbstractCegarLoop]: Abstraction has 2895 states and 4390 transitions. [2024-10-14 19:18:27,872 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-14 19:18:27,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 4390 transitions. [2024-10-14 19:18:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 19:18:27,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:27,873 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-14 19:18:27,878 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-14 19:18:28,074 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-14 19:18:28,074 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-14 19:18:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:28,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2016885832, now seen corresponding path program 1 times [2024-10-14 19:18:28,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:28,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853698983] [2024-10-14 19:18:28,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:28,075 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-14 19:18:28,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:28,077 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-14 19:18:28,078 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-14 19:18:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:28,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:28,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:28,233 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-14 19:18:28,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:28,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:28,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853698983] [2024-10-14 19:18:28,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853698983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:28,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105912073] [2024-10-14 19:18:28,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:28,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:28,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:28,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:28,234 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-14 19:18:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:29,068 INFO L93 Difference]: Finished difference Result 2875 states and 4258 transitions. [2024-10-14 19:18:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:29,068 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-14 19:18:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:29,072 INFO L225 Difference]: With dead ends: 2875 [2024-10-14 19:18:29,072 INFO L226 Difference]: Without dead ends: 2875 [2024-10-14 19:18:29,073 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-14 19:18:29,073 INFO L432 NwaCegarLoop]: 1503 mSDtfsCounter, 45 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:29,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4491 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:18:29,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2024-10-14 19:18:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2875. [2024-10-14 19:18:29,094 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-14 19:18:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 4258 transitions. [2024-10-14 19:18:29,097 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 4258 transitions. Word has length 19 [2024-10-14 19:18:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:29,097 INFO L471 AbstractCegarLoop]: Abstraction has 2875 states and 4258 transitions. [2024-10-14 19:18:29,097 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-14 19:18:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 4258 transitions. [2024-10-14 19:18:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 19:18:29,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:29,099 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-14 19:18:29,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:29,299 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-14 19:18:29,299 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-14 19:18:29,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1597166264, now seen corresponding path program 1 times [2024-10-14 19:18:29,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:29,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667463101] [2024-10-14 19:18:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:29,301 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-14 19:18:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:29,302 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-14 19:18:29,303 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-14 19:18:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:29,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:29,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:29,487 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-14 19:18:29,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:29,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:29,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667463101] [2024-10-14 19:18:29,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667463101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:29,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:29,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:29,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650425861] [2024-10-14 19:18:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:29,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:29,489 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-14 19:18:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:30,298 INFO L93 Difference]: Finished difference Result 2859 states and 4214 transitions. [2024-10-14 19:18:30,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:30,299 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-14 19:18:30,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:30,303 INFO L225 Difference]: With dead ends: 2859 [2024-10-14 19:18:30,303 INFO L226 Difference]: Without dead ends: 2859 [2024-10-14 19:18:30,303 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-14 19:18:30,303 INFO L432 NwaCegarLoop]: 1482 mSDtfsCounter, 45 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:30,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 4428 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:18:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2859 states. [2024-10-14 19:18:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2859 to 2859. [2024-10-14 19:18:30,322 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-14 19:18:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4214 transitions. [2024-10-14 19:18:30,325 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4214 transitions. Word has length 19 [2024-10-14 19:18:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:30,325 INFO L471 AbstractCegarLoop]: Abstraction has 2859 states and 4214 transitions. [2024-10-14 19:18:30,325 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-14 19:18:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4214 transitions. [2024-10-14 19:18:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 19:18:30,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:30,326 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-14 19:18:30,330 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-14 19:18:30,526 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-14 19:18:30,527 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-14 19:18:30,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:30,527 INFO L85 PathProgramCache]: Analyzing trace with hash -381678773, now seen corresponding path program 1 times [2024-10-14 19:18:30,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:30,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604827968] [2024-10-14 19:18:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:30,528 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-14 19:18:30,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:30,530 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-14 19:18:30,531 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-14 19:18:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:30,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:30,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:30,657 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-14 19:18:30,703 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-14 19:18:30,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:30,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604827968] [2024-10-14 19:18:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604827968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:30,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203131274] [2024-10-14 19:18:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:30,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:30,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:30,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:30,705 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-14 19:18:32,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:32,751 INFO L93 Difference]: Finished difference Result 3113 states and 4366 transitions. [2024-10-14 19:18:32,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:32,751 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-14 19:18:32,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:32,756 INFO L225 Difference]: With dead ends: 3113 [2024-10-14 19:18:32,756 INFO L226 Difference]: Without dead ends: 3113 [2024-10-14 19:18:32,756 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-14 19:18:32,756 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 1489 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:32,757 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.0s Time] [2024-10-14 19:18:32,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2024-10-14 19:18:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2855. [2024-10-14 19:18:32,777 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-14 19:18:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 4206 transitions. [2024-10-14 19:18:32,780 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 4206 transitions. Word has length 26 [2024-10-14 19:18:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:32,781 INFO L471 AbstractCegarLoop]: Abstraction has 2855 states and 4206 transitions. [2024-10-14 19:18:32,781 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-14 19:18:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 4206 transitions. [2024-10-14 19:18:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 19:18:32,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:32,782 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-14 19:18:32,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:18:32,982 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-14 19:18:32,982 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-14 19:18:32,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:32,983 INFO L85 PathProgramCache]: Analyzing trace with hash -381678772, now seen corresponding path program 1 times [2024-10-14 19:18:32,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:32,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523370538] [2024-10-14 19:18:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:32,983 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-14 19:18:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:32,984 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-14 19:18:32,985 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-14 19:18:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:33,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:18:33,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:33,119 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-14 19:18:33,217 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-14 19:18:33,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:33,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523370538] [2024-10-14 19:18:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523370538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:33,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:33,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:33,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341678795] [2024-10-14 19:18:33,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:33,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:33,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:33,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:33,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:33,219 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-14 19:18:36,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:36,158 INFO L93 Difference]: Finished difference Result 3523 states and 4946 transitions. [2024-10-14 19:18:36,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:36,158 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-14 19:18:36,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:36,163 INFO L225 Difference]: With dead ends: 3523 [2024-10-14 19:18:36,164 INFO L226 Difference]: Without dead ends: 3523 [2024-10-14 19:18:36,164 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-14 19:18:36,164 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 737 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 2123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:36,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2879 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2123 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 19:18:36,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2024-10-14 19:18:36,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 2888. [2024-10-14 19:18:36,184 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-14 19:18:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4244 transitions. [2024-10-14 19:18:36,187 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4244 transitions. Word has length 26 [2024-10-14 19:18:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:36,187 INFO L471 AbstractCegarLoop]: Abstraction has 2888 states and 4244 transitions. [2024-10-14 19:18:36,187 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-14 19:18:36,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4244 transitions. [2024-10-14 19:18:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 19:18:36,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:36,188 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-14 19:18:36,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-14 19:18:36,391 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-14 19:18:36,392 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-14 19:18:36,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:36,392 INFO L85 PathProgramCache]: Analyzing trace with hash -539382154, now seen corresponding path program 1 times [2024-10-14 19:18:36,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:36,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918915222] [2024-10-14 19:18:36,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:36,393 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-14 19:18:36,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:36,395 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-14 19:18:36,397 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-14 19:18:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:36,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:36,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:36,565 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-14 19:18:36,609 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-14 19:18:36,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:36,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:36,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918915222] [2024-10-14 19:18:36,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918915222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:36,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:36,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997876137] [2024-10-14 19:18:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:36,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:36,610 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-14 19:18:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:38,968 INFO L93 Difference]: Finished difference Result 3541 states and 4945 transitions. [2024-10-14 19:18:38,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:38,968 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-14 19:18:38,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:38,973 INFO L225 Difference]: With dead ends: 3541 [2024-10-14 19:18:38,973 INFO L226 Difference]: Without dead ends: 3541 [2024-10-14 19:18:38,974 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-14 19:18:38,975 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1526 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:38,975 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.3s Time] [2024-10-14 19:18:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2024-10-14 19:18:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 2884. [2024-10-14 19:18:39,013 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-14 19:18:39,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4220 transitions. [2024-10-14 19:18:39,017 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4220 transitions. Word has length 33 [2024-10-14 19:18:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:39,018 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4220 transitions. [2024-10-14 19:18:39,018 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-14 19:18:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4220 transitions. [2024-10-14 19:18:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 19:18:39,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:39,020 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-14 19:18:39,026 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-14 19:18:39,220 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-14 19:18:39,220 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-14 19:18:39,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:39,221 INFO L85 PathProgramCache]: Analyzing trace with hash -539382153, now seen corresponding path program 1 times [2024-10-14 19:18:39,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:39,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598578018] [2024-10-14 19:18:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:39,221 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-14 19:18:39,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:39,224 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-14 19:18:39,225 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-14 19:18:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:39,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:18:39,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:39,378 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-14 19:18:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:39,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:39,482 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:39,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598578018] [2024-10-14 19:18:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598578018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:39,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085365679] [2024-10-14 19:18:39,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:39,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:39,483 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-14 19:18:42,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:42,802 INFO L93 Difference]: Finished difference Result 4075 states and 5749 transitions. [2024-10-14 19:18:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:42,802 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-14 19:18:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:42,806 INFO L225 Difference]: With dead ends: 4075 [2024-10-14 19:18:42,806 INFO L226 Difference]: Without dead ends: 4075 [2024-10-14 19:18:42,807 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-14 19:18:42,807 INFO L432 NwaCegarLoop]: 1803 mSDtfsCounter, 1083 mSDsluCounter, 2003 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:42,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 3806 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 19:18:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4075 states. [2024-10-14 19:18:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4075 to 2884. [2024-10-14 19:18:42,825 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-14 19:18:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2884 states to 2884 states and 4212 transitions. [2024-10-14 19:18:42,827 INFO L78 Accepts]: Start accepts. Automaton has 2884 states and 4212 transitions. Word has length 33 [2024-10-14 19:18:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:42,828 INFO L471 AbstractCegarLoop]: Abstraction has 2884 states and 4212 transitions. [2024-10-14 19:18:42,828 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-14 19:18:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2884 states and 4212 transitions. [2024-10-14 19:18:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 19:18:42,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:42,828 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-14 19:18:42,832 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-14 19:18:43,028 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-14 19:18:43,029 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-14 19:18:43,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -514220746, now seen corresponding path program 1 times [2024-10-14 19:18:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402559825] [2024-10-14 19:18:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:43,030 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-14 19:18:43,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:43,031 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-14 19:18:43,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:18:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:43,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:43,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:43,178 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-14 19:18:43,221 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-14 19:18:43,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:43,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402559825] [2024-10-14 19:18:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402559825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005815463] [2024-10-14 19:18:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:43,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:43,223 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-14 19:18:45,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:45,503 INFO L93 Difference]: Finished difference Result 3521 states and 4913 transitions. [2024-10-14 19:18:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:45,503 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-14 19:18:45,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:45,506 INFO L225 Difference]: With dead ends: 3521 [2024-10-14 19:18:45,506 INFO L226 Difference]: Without dead ends: 3521 [2024-10-14 19:18:45,507 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-14 19:18:45,507 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 1522 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 2441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:45,507 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.2s Time] [2024-10-14 19:18:45,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2024-10-14 19:18:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2880. [2024-10-14 19:18:45,524 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-14 19:18:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 4204 transitions. [2024-10-14 19:18:45,527 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 4204 transitions. Word has length 33 [2024-10-14 19:18:45,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:45,528 INFO L471 AbstractCegarLoop]: Abstraction has 2880 states and 4204 transitions. [2024-10-14 19:18:45,528 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-14 19:18:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 4204 transitions. [2024-10-14 19:18:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 19:18:45,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:45,528 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-14 19:18:45,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:45,729 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-14 19:18:45,729 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-14 19:18:45,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash -514220745, now seen corresponding path program 1 times [2024-10-14 19:18:45,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:45,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439935186] [2024-10-14 19:18:45,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:45,730 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-14 19:18:45,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:45,732 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-14 19:18:45,733 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-14 19:18:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:45,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:18:45,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:45,921 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-14 19:18:46,017 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-14 19:18:46,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:46,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:46,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439935186] [2024-10-14 19:18:46,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439935186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:46,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:46,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:18:46,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772211553] [2024-10-14 19:18:46,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:46,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:46,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:46,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:46,019 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-14 19:18:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:49,379 INFO L93 Difference]: Finished difference Result 4067 states and 5733 transitions. [2024-10-14 19:18:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:49,379 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-14 19:18:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:49,383 INFO L225 Difference]: With dead ends: 4067 [2024-10-14 19:18:49,383 INFO L226 Difference]: Without dead ends: 4067 [2024-10-14 19:18:49,383 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-14 19:18:49,383 INFO L432 NwaCegarLoop]: 1799 mSDtfsCounter, 1075 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 2565 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:49,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 3771 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2565 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 19:18:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-10-14 19:18:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 2876. [2024-10-14 19:18:49,403 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-14 19:18:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4196 transitions. [2024-10-14 19:18:49,406 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4196 transitions. Word has length 33 [2024-10-14 19:18:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:49,406 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 4196 transitions. [2024-10-14 19:18:49,406 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-14 19:18:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4196 transitions. [2024-10-14 19:18:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-14 19:18:49,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:49,406 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-14 19:18:49,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-14 19:18:49,607 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-14 19:18:49,608 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-14 19:18:49,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:49,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1343686139, now seen corresponding path program 1 times [2024-10-14 19:18:49,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:49,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605456208] [2024-10-14 19:18:49,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:49,609 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-14 19:18:49,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:49,611 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-14 19:18:49,612 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-14 19:18:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:49,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:49,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:49,792 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-14 19:18:49,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:49,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:49,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605456208] [2024-10-14 19:18:49,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605456208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:49,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:49,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:49,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235583581] [2024-10-14 19:18:49,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:49,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:49,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:49,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:49,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:49,794 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-14 19:18:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:50,650 INFO L93 Difference]: Finished difference Result 2864 states and 4172 transitions. [2024-10-14 19:18:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:50,650 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-14 19:18:50,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:50,653 INFO L225 Difference]: With dead ends: 2864 [2024-10-14 19:18:50,653 INFO L226 Difference]: Without dead ends: 2864 [2024-10-14 19:18:50,653 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-14 19:18:50,654 INFO L432 NwaCegarLoop]: 1468 mSDtfsCounter, 21 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:50,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4381 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:18:50,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2024-10-14 19:18:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2864. [2024-10-14 19:18:50,690 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-14 19:18:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 4172 transitions. [2024-10-14 19:18:50,693 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 4172 transitions. Word has length 40 [2024-10-14 19:18:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:50,693 INFO L471 AbstractCegarLoop]: Abstraction has 2864 states and 4172 transitions. [2024-10-14 19:18:50,693 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-14 19:18:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 4172 transitions. [2024-10-14 19:18:50,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-14 19:18:50,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:50,694 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-14 19:18:50,698 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 (19)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:50,894 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-14 19:18:50,895 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-14 19:18:50,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2088153858, now seen corresponding path program 1 times [2024-10-14 19:18:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101328452] [2024-10-14 19:18:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:50,896 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-14 19:18:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:50,897 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-14 19:18:50,897 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-14 19:18:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:51,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:51,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:51,164 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-14 19:18:51,165 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:51,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101328452] [2024-10-14 19:18:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101328452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208988501] [2024-10-14 19:18:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:51,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:51,166 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-14 19:18:52,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:52,060 INFO L93 Difference]: Finished difference Result 4172 states and 5857 transitions. [2024-10-14 19:18:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:52,061 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-14 19:18:52,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:52,064 INFO L225 Difference]: With dead ends: 4172 [2024-10-14 19:18:52,065 INFO L226 Difference]: Without dead ends: 4172 [2024-10-14 19:18:52,065 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-14 19:18:52,065 INFO L432 NwaCegarLoop]: 1484 mSDtfsCounter, 1014 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:52,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 2906 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 19:18:52,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4172 states. [2024-10-14 19:18:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4172 to 3536. [2024-10-14 19:18:52,086 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-14 19:18:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 5440 transitions. [2024-10-14 19:18:52,089 INFO L78 Accepts]: Start accepts. Automaton has 3536 states and 5440 transitions. Word has length 44 [2024-10-14 19:18:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:52,089 INFO L471 AbstractCegarLoop]: Abstraction has 3536 states and 5440 transitions. [2024-10-14 19:18:52,089 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-14 19:18:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3536 states and 5440 transitions. [2024-10-14 19:18:52,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 19:18:52,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:52,090 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-14 19:18:52,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-14 19:18:52,290 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-14 19:18:52,291 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-14 19:18:52,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:52,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1373428208, now seen corresponding path program 1 times [2024-10-14 19:18:52,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:52,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522368914] [2024-10-14 19:18:52,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:52,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-14 19:18:52,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:52,293 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-14 19:18:52,293 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-14 19:18:52,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:52,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:52,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:52,509 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-14 19:18:52,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:52,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:52,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522368914] [2024-10-14 19:18:52,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522368914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:52,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:52,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:52,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063144680] [2024-10-14 19:18:52,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:52,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:52,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:52,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:52,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:52,510 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-14 19:18:53,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:53,341 INFO L93 Difference]: Finished difference Result 3494 states and 5370 transitions. [2024-10-14 19:18:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:53,342 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-14 19:18:53,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:53,345 INFO L225 Difference]: With dead ends: 3494 [2024-10-14 19:18:53,345 INFO L226 Difference]: Without dead ends: 3494 [2024-10-14 19:18:53,345 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-14 19:18:53,345 INFO L432 NwaCegarLoop]: 1464 mSDtfsCounter, 21 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:53,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 4369 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:18:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-14 19:18:53,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2024-10-14 19:18:53,366 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-14 19:18:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5370 transitions. [2024-10-14 19:18:53,369 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5370 transitions. Word has length 49 [2024-10-14 19:18:53,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:53,370 INFO L471 AbstractCegarLoop]: Abstraction has 3494 states and 5370 transitions. [2024-10-14 19:18:53,370 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-14 19:18:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5370 transitions. [2024-10-14 19:18:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 19:18:53,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:53,371 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-14 19:18:53,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-14 19:18:53,571 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-14 19:18:53,572 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-14 19:18:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:53,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1443981237, now seen corresponding path program 1 times [2024-10-14 19:18:53,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882603406] [2024-10-14 19:18:53,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:53,573 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-14 19:18:53,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:53,575 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-14 19:18:53,577 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-14 19:18:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:53,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:53,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:53,808 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-14 19:18:53,808 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:53,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882603406] [2024-10-14 19:18:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882603406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:53,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:53,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048456037] [2024-10-14 19:18:53,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:53,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:53,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:53,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:53,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:53,811 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-14 19:18:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:54,631 INFO L93 Difference]: Finished difference Result 3476 states and 5340 transitions. [2024-10-14 19:18:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:18:54,632 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-14 19:18:54,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:54,635 INFO L225 Difference]: With dead ends: 3476 [2024-10-14 19:18:54,635 INFO L226 Difference]: Without dead ends: 3476 [2024-10-14 19:18:54,635 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-14 19:18:54,635 INFO L432 NwaCegarLoop]: 1460 mSDtfsCounter, 15 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:54,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4363 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:18:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3476 states. [2024-10-14 19:18:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3476 to 3476. [2024-10-14 19:18:54,657 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-14 19:18:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5340 transitions. [2024-10-14 19:18:54,660 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5340 transitions. Word has length 52 [2024-10-14 19:18:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:54,660 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5340 transitions. [2024-10-14 19:18:54,661 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-14 19:18:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5340 transitions. [2024-10-14 19:18:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 19:18:54,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:54,661 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-14 19:18:54,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-14 19:18:54,865 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-14 19:18:54,866 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-14 19:18:54,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:54,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2083281976, now seen corresponding path program 1 times [2024-10-14 19:18:54,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:54,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913029552] [2024-10-14 19:18:54,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:54,867 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-14 19:18:54,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:54,868 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-14 19:18:54,869 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-14 19:18:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:55,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:18:55,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:55,058 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:55,059 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:55,060 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-14 19:18:55,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:18:55,083 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-14 19:18:55,100 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-14 19:18:55,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:55,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:55,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913029552] [2024-10-14 19:18:55,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913029552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:55,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:55,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:55,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844274910] [2024-10-14 19:18:55,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:55,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:55,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:55,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:55,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:55,102 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-14 19:18:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:56,996 INFO L93 Difference]: Finished difference Result 4728 states and 7149 transitions. [2024-10-14 19:18:56,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:18:56,998 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-14 19:18:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:57,002 INFO L225 Difference]: With dead ends: 4728 [2024-10-14 19:18:57,002 INFO L226 Difference]: Without dead ends: 4728 [2024-10-14 19:18:57,003 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-14 19:18:57,003 INFO L432 NwaCegarLoop]: 1591 mSDtfsCounter, 1535 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:57,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1544 Valid, 3965 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:18:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2024-10-14 19:18:57,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 3445. [2024-10-14 19:18:57,038 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-14 19:18:57,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3445 states to 3445 states and 5308 transitions. [2024-10-14 19:18:57,041 INFO L78 Accepts]: Start accepts. Automaton has 3445 states and 5308 transitions. Word has length 55 [2024-10-14 19:18:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:57,041 INFO L471 AbstractCegarLoop]: Abstraction has 3445 states and 5308 transitions. [2024-10-14 19:18:57,041 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-14 19:18:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3445 states and 5308 transitions. [2024-10-14 19:18:57,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 19:18:57,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:57,042 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-14 19:18:57,046 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-14 19:18:57,242 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-14 19:18:57,242 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-14 19:18:57,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -2106413678, now seen corresponding path program 1 times [2024-10-14 19:18:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:57,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202785888] [2024-10-14 19:18:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:57,243 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-14 19:18:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:57,244 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-14 19:18:57,245 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-14 19:18:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:57,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:18:57,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:57,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:18:57,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:57,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:57,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202785888] [2024-10-14 19:18:57,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202785888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:57,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:57,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:18:57,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950197243] [2024-10-14 19:18:57,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:57,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:18:57,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:57,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:18:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:18:57,576 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-14 19:18:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:18:58,383 INFO L93 Difference]: Finished difference Result 4570 states and 6768 transitions. [2024-10-14 19:18:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:18:58,384 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-14 19:18:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:18:58,388 INFO L225 Difference]: With dead ends: 4570 [2024-10-14 19:18:58,388 INFO L226 Difference]: Without dead ends: 4570 [2024-10-14 19:18:58,388 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-14 19:18:58,389 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 721 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:18:58,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 2961 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:18:58,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4570 states. [2024-10-14 19:18:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4570 to 4234. [2024-10-14 19:18:58,423 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-14 19:18:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4234 states to 4234 states and 6755 transitions. [2024-10-14 19:18:58,427 INFO L78 Accepts]: Start accepts. Automaton has 4234 states and 6755 transitions. Word has length 53 [2024-10-14 19:18:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:18:58,427 INFO L471 AbstractCegarLoop]: Abstraction has 4234 states and 6755 transitions. [2024-10-14 19:18:58,427 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-14 19:18:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 4234 states and 6755 transitions. [2024-10-14 19:18:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 19:18:58,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:18:58,428 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-14 19:18:58,434 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-14 19:18:58,628 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-14 19:18:58,629 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-14 19:18:58,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:18:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1490723271, now seen corresponding path program 1 times [2024-10-14 19:18:58,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:18:58,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015928605] [2024-10-14 19:18:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:18:58,630 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-14 19:18:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:18:58,631 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-14 19:18:58,631 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-14 19:18:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:18:58,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:18:58,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:18:58,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:58,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:58,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:18:58,899 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-14 19:18:58,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:18:58,991 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-14 19:18:58,998 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-14 19:18:58,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:18:58,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:18:58,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015928605] [2024-10-14 19:18:58,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015928605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:18:58,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:18:58,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:18:58,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917688561] [2024-10-14 19:18:58,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:18:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:18:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:18:59,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:18:59,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:18:59,000 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-14 19:19:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:00,339 INFO L93 Difference]: Finished difference Result 4551 states and 6834 transitions. [2024-10-14 19:19:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:19:00,339 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-14 19:19:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:00,343 INFO L225 Difference]: With dead ends: 4551 [2024-10-14 19:19:00,343 INFO L226 Difference]: Without dead ends: 4551 [2024-10-14 19:19:00,344 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-14 19:19:00,344 INFO L432 NwaCegarLoop]: 1467 mSDtfsCounter, 770 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:00,345 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.3s Time] [2024-10-14 19:19:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2024-10-14 19:19:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 3866. [2024-10-14 19:19:00,369 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-14 19:19:00,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 6124 transitions. [2024-10-14 19:19:00,373 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 6124 transitions. Word has length 56 [2024-10-14 19:19:00,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:00,374 INFO L471 AbstractCegarLoop]: Abstraction has 3866 states and 6124 transitions. [2024-10-14 19:19:00,374 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-14 19:19:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 6124 transitions. [2024-10-14 19:19:00,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 19:19:00,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:00,374 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-14 19:19:00,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-10-14 19:19:00,575 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-14 19:19:00,575 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-14 19:19:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1155902858, now seen corresponding path program 1 times [2024-10-14 19:19:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:00,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111530186] [2024-10-14 19:19:00,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:19:00,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:19:00,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:00,577 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-14 19:19:00,577 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-14 19:19:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:19:00,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 19:19:00,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:00,844 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-14 19:19:00,848 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-14 19:19:01,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:19:01,095 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-14 19:19:01,103 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:19:01,103 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-14 19:19:01,109 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-14 19:19:01,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:19:01,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:01,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111530186] [2024-10-14 19:19:01,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111530186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:19:01,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:19:01,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:19:01,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784679428] [2024-10-14 19:19:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:19:01,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:19:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:19:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:19:01,110 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-14 19:19:02,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:02,985 INFO L93 Difference]: Finished difference Result 3782 states and 5881 transitions. [2024-10-14 19:19:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:19:02,985 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-14 19:19:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:02,988 INFO L225 Difference]: With dead ends: 3782 [2024-10-14 19:19:02,988 INFO L226 Difference]: Without dead ends: 3782 [2024-10-14 19:19:02,989 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-14 19:19:02,989 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 2898 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:02,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2908 Valid, 507 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:19:02,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3782 states. [2024-10-14 19:19:03,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3782 to 3672. [2024-10-14 19:19:03,007 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-14 19:19:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5655 transitions. [2024-10-14 19:19:03,011 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5655 transitions. Word has length 56 [2024-10-14 19:19:03,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:03,011 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5655 transitions. [2024-10-14 19:19:03,011 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-14 19:19:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5655 transitions. [2024-10-14 19:19:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 19:19:03,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:03,011 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-14 19:19:03,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-10-14 19:19:03,211 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-14 19:19:03,212 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-14 19:19:03,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:03,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2001067946, now seen corresponding path program 1 times [2024-10-14 19:19:03,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:03,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839220722] [2024-10-14 19:19:03,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:19:03,213 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-14 19:19:03,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:03,214 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-14 19:19:03,215 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-14 19:19:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:19:03,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:19:03,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:03,443 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-14 19:19:03,454 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-14 19:19:03,468 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-14 19:19:03,473 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-14 19:19:03,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:19:03,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839220722] [2024-10-14 19:19:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839220722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:19:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:19:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:19:03,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042002544] [2024-10-14 19:19:03,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:19:03,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:19:03,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:19:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:19:03,474 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-14 19:19:05,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:05,724 INFO L93 Difference]: Finished difference Result 3671 states and 5652 transitions. [2024-10-14 19:19:05,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:19:05,725 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-14 19:19:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:05,728 INFO L225 Difference]: With dead ends: 3671 [2024-10-14 19:19:05,728 INFO L226 Difference]: Without dead ends: 3671 [2024-10-14 19:19:05,728 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-14 19:19:05,728 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 2 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:05,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3831 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 19:19:05,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2024-10-14 19:19:05,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3671. [2024-10-14 19:19:05,747 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-14 19:19:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3671 states to 3671 states and 5652 transitions. [2024-10-14 19:19:05,750 INFO L78 Accepts]: Start accepts. Automaton has 3671 states and 5652 transitions. Word has length 60 [2024-10-14 19:19:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:05,751 INFO L471 AbstractCegarLoop]: Abstraction has 3671 states and 5652 transitions. [2024-10-14 19:19:05,751 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-14 19:19:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3671 states and 5652 transitions. [2024-10-14 19:19:05,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 19:19:05,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:05,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:19:05,759 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 (27)] Forceful destruction successful, exit code 0 [2024-10-14 19:19:05,952 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-14 19:19:05,952 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-14 19:19:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2001067945, now seen corresponding path program 1 times [2024-10-14 19:19:05,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:05,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022193729] [2024-10-14 19:19:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:19:05,953 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-14 19:19:05,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:05,954 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-14 19:19:05,955 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-14 19:19:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:19:06,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:19:06,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:06,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:19:06,198 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-14 19:19:06,204 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-14 19:19:06,230 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-14 19:19:06,246 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-14 19:19:06,246 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:19:06,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:06,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022193729] [2024-10-14 19:19:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022193729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:19:06,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:19:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:19:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64086503] [2024-10-14 19:19:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:19:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:19:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:06,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:19:06,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:19:06,247 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-14 19:19:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:09,210 INFO L93 Difference]: Finished difference Result 3670 states and 5649 transitions. [2024-10-14 19:19:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:19:09,211 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-14 19:19:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:09,214 INFO L225 Difference]: With dead ends: 3670 [2024-10-14 19:19:09,214 INFO L226 Difference]: Without dead ends: 3670 [2024-10-14 19:19:09,215 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-14 19:19:09,215 INFO L432 NwaCegarLoop]: 1388 mSDtfsCounter, 1 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:09,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3781 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 19:19:09,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2024-10-14 19:19:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3670. [2024-10-14 19:19:09,248 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-14 19:19:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 5649 transitions. [2024-10-14 19:19:09,251 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 5649 transitions. Word has length 60 [2024-10-14 19:19:09,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:09,251 INFO L471 AbstractCegarLoop]: Abstraction has 3670 states and 5649 transitions. [2024-10-14 19:19:09,252 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-14 19:19:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 5649 transitions. [2024-10-14 19:19:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 19:19:09,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:09,252 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-14 19:19:09,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-10-14 19:19:09,452 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-14 19:19:09,453 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-14 19:19:09,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1012095322, now seen corresponding path program 1 times [2024-10-14 19:19:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:09,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177272250] [2024-10-14 19:19:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:19:09,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:19:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:09,455 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-14 19:19:09,456 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-14 19:19:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:19:09,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:19:09,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:09,699 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-14 19:19:09,699 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:19:09,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:09,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177272250] [2024-10-14 19:19:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177272250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:19:09,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:19:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:19:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120223750] [2024-10-14 19:19:09,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:19:09,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:19:09,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:09,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:19:09,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:19:09,701 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) [2024-10-14 19:19:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:10,538 INFO L93 Difference]: Finished difference Result 3672 states and 5656 transitions. [2024-10-14 19:19:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:19:10,539 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 66 [2024-10-14 19:19:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:10,544 INFO L225 Difference]: With dead ends: 3672 [2024-10-14 19:19:10,545 INFO L226 Difference]: Without dead ends: 3672 [2024-10-14 19:19:10,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:19:10,545 INFO L432 NwaCegarLoop]: 1387 mSDtfsCounter, 0 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:10,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4155 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 19:19:10,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2024-10-14 19:19:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3672. [2024-10-14 19:19:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 3004 states have (on average 1.8558588548601864) internal successors, (5575), 3634 states have internal predecessors, (5575), 38 states have call successors, (38), 3 states have call predecessors, (38), 4 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-14 19:19:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5656 transitions. [2024-10-14 19:19:10,578 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5656 transitions. Word has length 66 [2024-10-14 19:19:10,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:10,578 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5656 transitions. [2024-10-14 19:19:10,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-10-14 19:19:10,578 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5656 transitions. [2024-10-14 19:19:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 19:19:10,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:10,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:19:10,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2024-10-14 19:19:10,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-14 19:19:10,779 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-14 19:19:10,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:10,779 INFO L85 PathProgramCache]: Analyzing trace with hash 723660779, now seen corresponding path program 1 times [2024-10-14 19:19:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:10,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220058209] [2024-10-14 19:19:10,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:19:10,780 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-14 19:19:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:10,781 INFO L229 MonitoredProcess]: Starting monitored process 30 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-14 19:19:10,782 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 (30)] Waiting until timeout for monitored process [2024-10-14 19:19:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:19:11,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:19:11,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:11,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:19:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:11,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:11,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220058209] [2024-10-14 19:19:11,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220058209] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:19:11,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:19:11,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:19:11,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739303903] [2024-10-14 19:19:11,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:19:11,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:19:11,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:11,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:19:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:19:11,101 INFO L87 Difference]: Start difference. First operand 3672 states and 5656 transitions. Second operand has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:19:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:12,347 INFO L93 Difference]: Finished difference Result 3681 states and 5674 transitions. [2024-10-14 19:19:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:19:12,347 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2024-10-14 19:19:12,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:12,353 INFO L225 Difference]: With dead ends: 3681 [2024-10-14 19:19:12,353 INFO L226 Difference]: Without dead ends: 3681 [2024-10-14 19:19:12,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:19:12,353 INFO L432 NwaCegarLoop]: 1385 mSDtfsCounter, 4 mSDsluCounter, 5526 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6911 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:12,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6911 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:19:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3681 states. [2024-10-14 19:19:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3681 to 3680. [2024-10-14 19:19:12,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3680 states, 3011 states have (on average 1.8558618399202922) internal successors, (5588), 3641 states have internal predecessors, (5588), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-14 19:19:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5669 transitions. [2024-10-14 19:19:12,379 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 5669 transitions. Word has length 67 [2024-10-14 19:19:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:12,379 INFO L471 AbstractCegarLoop]: Abstraction has 3680 states and 5669 transitions. [2024-10-14 19:19:12,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:19:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 5669 transitions. [2024-10-14 19:19:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 19:19:12,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:12,380 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:19:12,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 (30)] Forceful destruction successful, exit code 0 [2024-10-14 19:19:12,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-14 19:19:12,581 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-14 19:19:12,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:12,581 INFO L85 PathProgramCache]: Analyzing trace with hash -459475558, now seen corresponding path program 2 times [2024-10-14 19:19:12,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:12,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692104176] [2024-10-14 19:19:12,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:19:12,582 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-14 19:19:12,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:12,583 INFO L229 MonitoredProcess]: Starting monitored process 31 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-14 19:19:12,583 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 (31)] Waiting until timeout for monitored process [2024-10-14 19:19:12,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:19:12,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:19:12,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:19:12,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:12,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:19:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:13,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:13,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692104176] [2024-10-14 19:19:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692104176] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:19:13,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:19:13,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:19:13,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874020788] [2024-10-14 19:19:13,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:19:13,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:19:13,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:13,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:19:13,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:19:13,090 INFO L87 Difference]: Start difference. First operand 3680 states and 5669 transitions. Second operand has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:19:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:14,908 INFO L93 Difference]: Finished difference Result 3692 states and 5687 transitions. [2024-10-14 19:19:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:19:14,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2024-10-14 19:19:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:14,913 INFO L225 Difference]: With dead ends: 3692 [2024-10-14 19:19:14,914 INFO L226 Difference]: Without dead ends: 3689 [2024-10-14 19:19:14,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 19:19:14,914 INFO L432 NwaCegarLoop]: 1385 mSDtfsCounter, 7 mSDsluCounter, 6911 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 8296 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:14,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 8296 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:19:14,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2024-10-14 19:19:14,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3689. [2024-10-14 19:19:14,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3689 states, 3020 states have (on average 1.8539735099337749) internal successors, (5599), 3650 states have internal predecessors, (5599), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-14 19:19:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3689 states to 3689 states and 5680 transitions. [2024-10-14 19:19:14,939 INFO L78 Accepts]: Start accepts. Automaton has 3689 states and 5680 transitions. Word has length 70 [2024-10-14 19:19:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:14,939 INFO L471 AbstractCegarLoop]: Abstraction has 3689 states and 5680 transitions. [2024-10-14 19:19:14,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 14 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:19:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3689 states and 5680 transitions. [2024-10-14 19:19:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 19:19:14,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:14,940 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:19:14,948 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 (31)] Ended with exit code 0 [2024-10-14 19:19:15,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-14 19:19:15,141 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-14 19:19:15,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -441113606, now seen corresponding path program 3 times [2024-10-14 19:19:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:15,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168345622] [2024-10-14 19:19:15,142 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:19:15,142 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-14 19:19:15,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:15,145 INFO L229 MonitoredProcess]: Starting monitored process 32 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-14 19:19:15,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2024-10-14 19:19:15,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:19:15,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:19:15,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:19:15,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:15,789 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:15,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:19:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:16,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:16,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168345622] [2024-10-14 19:19:16,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168345622] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:19:16,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:19:16,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:19:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182308354] [2024-10-14 19:19:16,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:19:16,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:19:16,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:16,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:19:16,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:19:16,135 INFO L87 Difference]: Start difference. First operand 3689 states and 5680 transitions. Second operand has 26 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 26 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:19:20,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:19:20,530 INFO L93 Difference]: Finished difference Result 3710 states and 5716 transitions. [2024-10-14 19:19:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:19:20,531 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 26 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2024-10-14 19:19:20,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:19:20,536 INFO L225 Difference]: With dead ends: 3710 [2024-10-14 19:19:20,536 INFO L226 Difference]: Without dead ends: 3707 [2024-10-14 19:19:20,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:19:20,536 INFO L432 NwaCegarLoop]: 1385 mSDtfsCounter, 13 mSDsluCounter, 17969 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19354 SdHoareTripleChecker+Invalid, 2960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:19:20,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19354 Invalid, 2960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2929 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 19:19:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2024-10-14 19:19:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2024-10-14 19:19:20,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3707 states, 3038 states have (on average 1.8505595786701778) internal successors, (5622), 3668 states have internal predecessors, (5622), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-14 19:19:20,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 5703 transitions. [2024-10-14 19:19:20,564 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 5703 transitions. Word has length 76 [2024-10-14 19:19:20,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:19:20,564 INFO L471 AbstractCegarLoop]: Abstraction has 3707 states and 5703 transitions. [2024-10-14 19:19:20,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5833333333333335) internal successors, (86), 26 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:19:20,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 5703 transitions. [2024-10-14 19:19:20,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-14 19:19:20,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:19:20,565 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:19:20,575 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 (32)] Forceful destruction successful, exit code 0 [2024-10-14 19:19:20,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-14 19:19:20,766 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 983 more)] === [2024-10-14 19:19:20,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:19:20,767 INFO L85 PathProgramCache]: Analyzing trace with hash 53389498, now seen corresponding path program 4 times [2024-10-14 19:19:20,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:19:20,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739272917] [2024-10-14 19:19:20,767 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:19:20,767 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-14 19:19:20,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:19:20,769 INFO L229 MonitoredProcess]: Starting monitored process 33 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-14 19:19:20,770 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 (33)] Waiting until timeout for monitored process [2024-10-14 19:19:21,160 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:19:21,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:19:21,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:19:21,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:19:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:21,433 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:19:22,354 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:19:22,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:19:22,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739272917] [2024-10-14 19:19:22,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739272917] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:19:22,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:19:22,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:19:22,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517655993] [2024-10-14 19:19:22,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:19:22,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:19:22,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:19:22,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:19:22,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:19:22,356 INFO L87 Difference]: Start difference. First operand 3707 states and 5703 transitions. Second operand has 50 states, 48 states have (on average 2.2916666666666665) internal successors, (110), 50 states have internal predecessors, (110), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)