./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_JEN_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:53:20,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:53:20,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:53:20,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:53:20,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:53:20,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:53:20,909 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:53:20,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:53:20,910 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:53:20,911 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:53:20,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:53:20,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:53:20,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:53:20,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:53:20,913 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:53:20,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:53:20,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:53:20,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:53:20,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:53:20,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:53:20,916 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:53:20,916 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:53:20,917 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:53:20,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:53:20,917 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:53:20,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:53:20,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:53:20,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:53:20,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:53:20,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:53:20,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:53:20,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:53:20,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:53:20,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:53:20,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:53:20,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:53:20,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:53:20,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:53:20,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:53:20,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:53:20,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:53:20,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:53:20,924 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 -> 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 [2024-10-13 11:53:21,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:53:21,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:53:21,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:53:21,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:53:21,277 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:53:21,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2024-10-13 11:53:22,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:53:23,075 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:53:23,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2024-10-13 11:53:23,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916b3468d/8b4878dce6204d10834d109d513f27b1/FLAGc177034d2 [2024-10-13 11:53:23,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916b3468d/8b4878dce6204d10834d109d513f27b1 [2024-10-13 11:53:23,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:53:23,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:53:23,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:23,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:53:23,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:53:23,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:23" (1/1) ... [2024-10-13 11:53:23,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@673dcf2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:23, skipping insertion in model container [2024-10-13 11:53:23,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:23" (1/1) ... [2024-10-13 11:53:23,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:53:23,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:24,014 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 11:53:24,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4289838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:24, skipping insertion in model container [2024-10-13 11:53:24,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:24,015 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:53:24,017 INFO L158 Benchmark]: Toolchain (without parser) took 687.50ms. Allocated memory is still 169.9MB. Free memory was 139.7MB in the beginning and 115.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 11:53:24,017 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:53:24,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.37ms. Allocated memory is still 169.9MB. Free memory was 139.7MB in the beginning and 115.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 11:53:24,021 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.14ms. Allocated memory is still 169.9MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.37ms. Allocated memory is still 169.9MB. Free memory was 139.7MB in the beginning and 115.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_JEN_test4-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:53:26,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:53:26,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:53:26,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:53:26,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:53:26,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:53:26,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:53:26,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:53:26,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:53:26,306 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:53:26,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:53:26,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:53:26,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:53:26,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:53:26,310 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:53:26,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:53:26,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:53:26,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:53:26,311 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:53:26,311 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:53:26,312 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:53:26,312 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:53:26,313 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:53:26,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:53:26,314 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:53:26,314 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:53:26,315 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:53:26,315 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:53:26,315 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:53:26,316 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:53:26,316 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:53:26,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:53:26,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:53:26,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:53:26,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:53:26,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:53:26,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:53:26,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:53:26,319 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:53:26,319 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:53:26,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:53:26,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:53:26,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:53:26,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:53:26,320 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:53:26,320 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 -> 6c366d24ef9ea71cc6362f44963cc0aaadef105bf25ae7c56112d839540c58b5 [2024-10-13 11:53:26,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:53:26,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:53:26,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:53:26,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:53:26,672 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:53:26,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2024-10-13 11:53:28,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:53:28,478 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:53:28,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-3.i [2024-10-13 11:53:28,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18e6a0ce/eb90dd033a9a41c6b890cf7d8a6d9ea6/FLAG932a2406d [2024-10-13 11:53:28,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d18e6a0ce/eb90dd033a9a41c6b890cf7d8a6d9ea6 [2024-10-13 11:53:28,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:53:28,750 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:53:28,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:28,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:53:28,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:53:28,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:28" (1/1) ... [2024-10-13 11:53:28,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bc353a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:28, skipping insertion in model container [2024-10-13 11:53:28,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:53:28" (1/1) ... [2024-10-13 11:53:28,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:53:29,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:29,476 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:53:29,492 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:53:29,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:29,621 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:53:29,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:53:29,771 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:53:29,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29 WrapperNode [2024-10-13 11:53:29,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:53:29,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:53:29,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:53:29,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:53:29,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:29,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:29,918 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1498 [2024-10-13 11:53:29,921 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:53:29,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:53:29,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:53:29,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:53:29,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:29,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:29,951 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,116 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-10-13 11:53:30,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,123 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,185 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:53:30,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:53:30,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:53:30,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:53:30,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (1/1) ... [2024-10-13 11:53:30,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:53:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:53:30,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 11:53:30,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:53:30,315 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:53:30,315 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:53:30,315 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:53:30,316 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:53:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:53:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:53:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:53:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:53:30,316 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:53:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:53:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:53:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:53:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:53:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:53:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:53:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:53:30,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:53:30,570 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:53:30,573 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:53:30,577 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:53:30,631 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:53:36,066 INFO L? ?]: Removed 1749 outVars from TransFormulas that were not future-live. [2024-10-13 11:53:36,068 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:53:36,286 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:53:36,287 INFO L314 CfgBuilder]: Removed 77 assume(true) statements. [2024-10-13 11:53:36,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:36 BoogieIcfgContainer [2024-10-13 11:53:36,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:53:36,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:53:36,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:53:36,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:53:36,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:53:28" (1/3) ... [2024-10-13 11:53:36,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61897dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:36, skipping insertion in model container [2024-10-13 11:53:36,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:53:29" (2/3) ... [2024-10-13 11:53:36,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61897dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:53:36, skipping insertion in model container [2024-10-13 11:53:36,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:53:36" (3/3) ... [2024-10-13 11:53:36,297 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-3.i [2024-10-13 11:53:36,311 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:53:36,311 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 831 error locations. [2024-10-13 11:53:36,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:53:36,402 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;@4bac092b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:53:36,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 831 error locations. [2024-10-13 11:53:36,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 1477 states, 633 states have (on average 2.5624012638230647) internal successors, (1622), 1468 states have internal predecessors, (1622), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:53:36,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:36,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:53:36,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:36,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:36,427 INFO L85 PathProgramCache]: Analyzing trace with hash 77782477, now seen corresponding path program 1 times [2024-10-13 11:53:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779069310] [2024-10-13 11:53:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:36,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:36,445 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:36,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 11:53:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:36,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:53:36,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:36,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:53:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:36,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:36,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:36,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779069310] [2024-10-13 11:53:36,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779069310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:36,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:36,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:53:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079275461] [2024-10-13 11:53:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:36,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:36,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:36,753 INFO L87 Difference]: Start difference. First operand has 1477 states, 633 states have (on average 2.5624012638230647) internal successors, (1622), 1468 states have internal predecessors, (1622), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:39,371 INFO L93 Difference]: Finished difference Result 1366 states and 1458 transitions. [2024-10-13 11:53:39,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:39,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 11:53:39,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:39,398 INFO L225 Difference]: With dead ends: 1366 [2024-10-13 11:53:39,399 INFO L226 Difference]: Without dead ends: 1365 [2024-10-13 11:53:39,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:39,404 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 926 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:39,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 982 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 11:53:39,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-10-13 11:53:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1363. [2024-10-13 11:53:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 624 states have (on average 2.2788461538461537) internal successors, (1422), 1354 states have internal predecessors, (1422), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1454 transitions. [2024-10-13 11:53:39,497 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1454 transitions. Word has length 4 [2024-10-13 11:53:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:39,498 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1454 transitions. [2024-10-13 11:53:39,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:39,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1454 transitions. [2024-10-13 11:53:39,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-13 11:53:39,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:39,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-13 11:53:39,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 11:53:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:39,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 77782478, now seen corresponding path program 1 times [2024-10-13 11:53:39,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:39,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152542533] [2024-10-13 11:53:39,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:39,707 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:39,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:39,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:39,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 11:53:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:39,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:53:39,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:39,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:53:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:39,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:39,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:39,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152542533] [2024-10-13 11:53:39,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152542533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:39,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:53:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88987021] [2024-10-13 11:53:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:39,901 INFO L87 Difference]: Start difference. First operand 1363 states and 1454 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:42,766 INFO L93 Difference]: Finished difference Result 1643 states and 1754 transitions. [2024-10-13 11:53:42,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:42,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-10-13 11:53:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:42,772 INFO L225 Difference]: With dead ends: 1643 [2024-10-13 11:53:42,773 INFO L226 Difference]: Without dead ends: 1643 [2024-10-13 11:53:42,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:42,774 INFO L432 NwaCegarLoop]: 1116 mSDtfsCounter, 464 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:42,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1668 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:53:42,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2024-10-13 11:53:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1492. [2024-10-13 11:53:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1492 states, 763 states have (on average 2.2332896461336826) internal successors, (1704), 1483 states have internal predecessors, (1704), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:42,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1736 transitions. [2024-10-13 11:53:42,812 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1736 transitions. Word has length 4 [2024-10-13 11:53:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:42,813 INFO L471 AbstractCegarLoop]: Abstraction has 1492 states and 1736 transitions. [2024-10-13 11:53:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1736 transitions. [2024-10-13 11:53:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-13 11:53:42,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:42,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-13 11:53:42,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 11:53:43,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:43,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:43,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1882051010, now seen corresponding path program 1 times [2024-10-13 11:53:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432596232] [2024-10-13 11:53:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:43,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:43,018 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:43,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 11:53:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:43,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:53:43,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:43,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:43,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432596232] [2024-10-13 11:53:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432596232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:53:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710160564] [2024-10-13 11:53:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:43,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:43,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:43,161 INFO L87 Difference]: Start difference. First operand 1492 states and 1736 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:44,362 INFO L93 Difference]: Finished difference Result 2592 states and 3041 transitions. [2024-10-13 11:53:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:44,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2024-10-13 11:53:44,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:44,373 INFO L225 Difference]: With dead ends: 2592 [2024-10-13 11:53:44,373 INFO L226 Difference]: Without dead ends: 2592 [2024-10-13 11:53:44,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:44,374 INFO L432 NwaCegarLoop]: 1680 mSDtfsCounter, 1000 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:44,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 2967 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:53:44,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2024-10-13 11:53:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 1493. [2024-10-13 11:53:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 764 states have (on average 2.231675392670157) internal successors, (1705), 1484 states have internal predecessors, (1705), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:44,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1737 transitions. [2024-10-13 11:53:44,411 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1737 transitions. Word has length 5 [2024-10-13 11:53:44,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:44,412 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 1737 transitions. [2024-10-13 11:53:44,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1737 transitions. [2024-10-13 11:53:44,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:53:44,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:44,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:53:44,418 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-13 11:53:44,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:44,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:44,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1357177001, now seen corresponding path program 1 times [2024-10-13 11:53:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:44,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399469037] [2024-10-13 11:53:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:44,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:44,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:44,618 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:44,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 11:53:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:44,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:53:44,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:44,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:44,786 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:44,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:44,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399469037] [2024-10-13 11:53:44,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399469037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:44,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:53:44,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579778141] [2024-10-13 11:53:44,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:44,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:44,788 INFO L87 Difference]: Start difference. First operand 1493 states and 1737 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:45,914 INFO L93 Difference]: Finished difference Result 1454 states and 1697 transitions. [2024-10-13 11:53:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:45,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 11:53:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:45,922 INFO L225 Difference]: With dead ends: 1454 [2024-10-13 11:53:45,922 INFO L226 Difference]: Without dead ends: 1454 [2024-10-13 11:53:45,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:45,924 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 61 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:45,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2442 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:53:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2024-10-13 11:53:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1454. [2024-10-13 11:53:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 749 states have (on average 2.2229639519359146) internal successors, (1665), 1445 states have internal predecessors, (1665), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:45,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 1697 transitions. [2024-10-13 11:53:45,965 INFO L78 Accepts]: Start accepts. Automaton has 1454 states and 1697 transitions. Word has length 10 [2024-10-13 11:53:45,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:45,965 INFO L471 AbstractCegarLoop]: Abstraction has 1454 states and 1697 transitions. [2024-10-13 11:53:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1454 states and 1697 transitions. [2024-10-13 11:53:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:53:45,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:45,966 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:53:45,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 11:53:46,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:46,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1422956145, now seen corresponding path program 1 times [2024-10-13 11:53:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302347283] [2024-10-13 11:53:46,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:46,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:46,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:46,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:46,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:53:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:46,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:53:46,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:46,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:46,345 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:46,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:46,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302347283] [2024-10-13 11:53:46,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302347283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:46,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:46,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:53:46,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279250872] [2024-10-13 11:53:46,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:46,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:53:46,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:53:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:53:46,348 INFO L87 Difference]: Start difference. First operand 1454 states and 1697 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:47,565 INFO L93 Difference]: Finished difference Result 1439 states and 1675 transitions. [2024-10-13 11:53:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:53:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 11:53:47,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:47,572 INFO L225 Difference]: With dead ends: 1439 [2024-10-13 11:53:47,572 INFO L226 Difference]: Without dead ends: 1439 [2024-10-13 11:53:47,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:53:47,573 INFO L432 NwaCegarLoop]: 1211 mSDtfsCounter, 45 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:47,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 3615 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:53:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-13 11:53:47,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1439. [2024-10-13 11:53:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 748 states have (on average 2.196524064171123) internal successors, (1643), 1430 states have internal predecessors, (1643), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:47,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1675 transitions. [2024-10-13 11:53:47,605 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1675 transitions. Word has length 12 [2024-10-13 11:53:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:47,606 INFO L471 AbstractCegarLoop]: Abstraction has 1439 states and 1675 transitions. [2024-10-13 11:53:47,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:47,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1675 transitions. [2024-10-13 11:53:47,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:53:47,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:47,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:53:47,615 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-13 11:53:47,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:47,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:47,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2095155681, now seen corresponding path program 1 times [2024-10-13 11:53:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:47,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434241644] [2024-10-13 11:53:47,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:47,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:47,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:47,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:47,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 11:53:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:47,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:53:47,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:47,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:53:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:48,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:48,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434241644] [2024-10-13 11:53:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434241644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:53:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441928899] [2024-10-13 11:53:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:48,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:53:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:53:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:53:48,087 INFO L87 Difference]: Start difference. First operand 1439 states and 1675 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:50,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:50,679 INFO L93 Difference]: Finished difference Result 1439 states and 1675 transitions. [2024-10-13 11:53:50,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:53:50,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:53:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:50,684 INFO L225 Difference]: With dead ends: 1439 [2024-10-13 11:53:50,684 INFO L226 Difference]: Without dead ends: 1439 [2024-10-13 11:53:50,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:53:50,686 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 870 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:50,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1486 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 11:53:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-10-13 11:53:50,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1435. [2024-10-13 11:53:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1435 states, 748 states have (on average 2.1911764705882355) internal successors, (1639), 1426 states have internal predecessors, (1639), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1671 transitions. [2024-10-13 11:53:50,710 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1671 transitions. Word has length 26 [2024-10-13 11:53:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:50,710 INFO L471 AbstractCegarLoop]: Abstraction has 1435 states and 1671 transitions. [2024-10-13 11:53:50,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1671 transitions. [2024-10-13 11:53:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:53:50,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:50,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:53:50,732 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 (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:53:50,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:50,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:50,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2095155680, now seen corresponding path program 1 times [2024-10-13 11:53:50,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:50,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198171852] [2024-10-13 11:53:50,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:50,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:50,928 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:50,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 11:53:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:51,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:53:51,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:51,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:53:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:51,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:51,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:51,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198171852] [2024-10-13 11:53:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198171852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:53:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479666888] [2024-10-13 11:53:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:51,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:53:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:53:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:53:51,298 INFO L87 Difference]: Start difference. First operand 1435 states and 1671 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:54,641 INFO L93 Difference]: Finished difference Result 1586 states and 1689 transitions. [2024-10-13 11:53:54,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:53:54,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:53:54,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:54,645 INFO L225 Difference]: With dead ends: 1586 [2024-10-13 11:53:54,645 INFO L226 Difference]: Without dead ends: 1586 [2024-10-13 11:53:54,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:53:54,646 INFO L432 NwaCegarLoop]: 1080 mSDtfsCounter, 404 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 1769 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:54,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 2221 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1769 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 11:53:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-10-13 11:53:54,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1431. [2024-10-13 11:53:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 748 states have (on average 2.185828877005348) internal successors, (1635), 1422 states have internal predecessors, (1635), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1667 transitions. [2024-10-13 11:53:54,672 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 1667 transitions. Word has length 26 [2024-10-13 11:53:54,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:54,673 INFO L471 AbstractCegarLoop]: Abstraction has 1431 states and 1667 transitions. [2024-10-13 11:53:54,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:54,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 1667 transitions. [2024-10-13 11:53:54,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-13 11:53:54,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:54,674 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] [2024-10-13 11:53:54,680 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-13 11:53:54,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:54,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:54,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -265398887, now seen corresponding path program 1 times [2024-10-13 11:53:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352576256] [2024-10-13 11:53:54,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:54,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:54,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:54,879 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:54,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 11:53:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:55,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:53:55,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:55,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-13 11:53:55,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:55,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352576256] [2024-10-13 11:53:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352576256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:53:55,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553015756] [2024-10-13 11:53:55,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:53:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:55,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:53:55,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:53:55,111 INFO L87 Difference]: Start difference. First operand 1431 states and 1667 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:56,210 INFO L93 Difference]: Finished difference Result 1425 states and 1657 transitions. [2024-10-13 11:53:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:53:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-10-13 11:53:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:56,216 INFO L225 Difference]: With dead ends: 1425 [2024-10-13 11:53:56,216 INFO L226 Difference]: Without dead ends: 1425 [2024-10-13 11:53:56,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:53:56,217 INFO L432 NwaCegarLoop]: 1205 mSDtfsCounter, 15 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:56,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3598 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 11:53:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-10-13 11:53:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1425. [2024-10-13 11:53:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1425 states, 742 states have (on average 2.1900269541778976) internal successors, (1625), 1416 states have internal predecessors, (1625), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1425 states to 1425 states and 1657 transitions. [2024-10-13 11:53:56,242 INFO L78 Accepts]: Start accepts. Automaton has 1425 states and 1657 transitions. Word has length 42 [2024-10-13 11:53:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:56,242 INFO L471 AbstractCegarLoop]: Abstraction has 1425 states and 1657 transitions. [2024-10-13 11:53:56,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:56,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1425 states and 1657 transitions. [2024-10-13 11:53:56,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 11:53:56,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:56,243 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] [2024-10-13 11:53:56,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 11:53:56,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:56,445 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:56,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:56,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1779261689, now seen corresponding path program 1 times [2024-10-13 11:53:56,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:56,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352281040] [2024-10-13 11:53:56,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:56,447 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:56,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 11:53:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:56,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:53:56,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:56,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:56,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:56,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352281040] [2024-10-13 11:53:56,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352281040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:56,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:53:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816922377] [2024-10-13 11:53:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:56,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:53:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:53:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:56,924 INFO L87 Difference]: Start difference. First operand 1425 states and 1657 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:53:57,961 INFO L93 Difference]: Finished difference Result 1787 states and 2056 transitions. [2024-10-13 11:53:57,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:53:57,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-13 11:53:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:53:57,967 INFO L225 Difference]: With dead ends: 1787 [2024-10-13 11:53:57,968 INFO L226 Difference]: Without dead ends: 1787 [2024-10-13 11:53:57,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:53:57,968 INFO L432 NwaCegarLoop]: 1271 mSDtfsCounter, 334 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 2428 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:53:57,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 2428 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:53:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1787 states. [2024-10-13 11:53:57,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1787 to 1468. [2024-10-13 11:53:57,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 785 states have (on average 2.12484076433121) internal successors, (1668), 1459 states have internal predecessors, (1668), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:53:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1700 transitions. [2024-10-13 11:53:57,994 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1700 transitions. Word has length 46 [2024-10-13 11:53:57,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:53:57,994 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1700 transitions. [2024-10-13 11:53:57,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:53:57,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1700 transitions. [2024-10-13 11:53:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-13 11:53:57,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:53:57,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:53:58,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 11:53:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:58,196 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:53:58,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:53:58,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1686104230, now seen corresponding path program 1 times [2024-10-13 11:53:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:53:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440390556] [2024-10-13 11:53:58,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:53:58,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:53:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:53:58,201 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:53:58,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 11:53:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:53:58,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:53:58,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:53:58,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:53:58,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:53:59,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:53:59,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:53:59,022 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:53:59,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 11:53:59,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:53:59,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:53:59,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:53:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440390556] [2024-10-13 11:53:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440390556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:53:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:53:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:53:59,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467939944] [2024-10-13 11:53:59,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:53:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:53:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:53:59,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:53:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:53:59,045 INFO L87 Difference]: Start difference. First operand 1468 states and 1700 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:01,145 INFO L93 Difference]: Finished difference Result 1384 states and 1616 transitions. [2024-10-13 11:54:01,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:01,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-10-13 11:54:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:01,149 INFO L225 Difference]: With dead ends: 1384 [2024-10-13 11:54:01,149 INFO L226 Difference]: Without dead ends: 1384 [2024-10-13 11:54:01,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:01,150 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 1564 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:01,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1570 Valid, 799 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:54:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-10-13 11:54:01,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1245. [2024-10-13 11:54:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 646 states have (on average 2.0) internal successors, (1292), 1236 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:54:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1324 transitions. [2024-10-13 11:54:01,176 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1324 transitions. Word has length 49 [2024-10-13 11:54:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:01,177 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1324 transitions. [2024-10-13 11:54:01,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1324 transitions. [2024-10-13 11:54:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 11:54:01,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:01,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:01,188 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-13 11:54:01,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:01,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:01,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:01,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1533535740, now seen corresponding path program 1 times [2024-10-13 11:54:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:01,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85339993] [2024-10-13 11:54:01,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:01,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:01,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:01,381 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:01,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 11:54:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:01,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:54:01,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:01,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 11:54:01,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:54:01,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-13 11:54:01,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:01,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:01,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85339993] [2024-10-13 11:54:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85339993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:01,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:01,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024425925] [2024-10-13 11:54:01,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:01,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:54:01,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:54:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:01,715 INFO L87 Difference]: Start difference. First operand 1245 states and 1324 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:04,618 INFO L93 Difference]: Finished difference Result 1244 states and 1323 transitions. [2024-10-13 11:54:04,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:54:04,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-13 11:54:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:04,622 INFO L225 Difference]: With dead ends: 1244 [2024-10-13 11:54:04,622 INFO L226 Difference]: Without dead ends: 1244 [2024-10-13 11:54:04,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:54:04,623 INFO L432 NwaCegarLoop]: 1133 mSDtfsCounter, 2 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:04,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2908 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 11:54:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-13 11:54:04,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1244. [2024-10-13 11:54:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 646 states have (on average 1.998452012383901) internal successors, (1291), 1235 states have internal predecessors, (1291), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:54:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1323 transitions. [2024-10-13 11:54:04,641 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1323 transitions. Word has length 53 [2024-10-13 11:54:04,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:04,641 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 1323 transitions. [2024-10-13 11:54:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1323 transitions. [2024-10-13 11:54:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-13 11:54:04,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:04,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:04,651 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 (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:04,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:04,844 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1533535741, now seen corresponding path program 1 times [2024-10-13 11:54:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903447287] [2024-10-13 11:54:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:04,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:04,846 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:04,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:54:05,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:05,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 11:54:05,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:05,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 11:54:05,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:54:05,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-13 11:54:05,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-13 11:54:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:05,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:05,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:05,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903447287] [2024-10-13 11:54:05,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903447287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:05,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:05,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:05,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875958794] [2024-10-13 11:54:05,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:05,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:54:05,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:05,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:54:05,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:54:05,168 INFO L87 Difference]: Start difference. First operand 1244 states and 1323 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:08,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:08,568 INFO L93 Difference]: Finished difference Result 1243 states and 1322 transitions. [2024-10-13 11:54:08,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:54:08,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-13 11:54:08,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:08,571 INFO L225 Difference]: With dead ends: 1243 [2024-10-13 11:54:08,571 INFO L226 Difference]: Without dead ends: 1243 [2024-10-13 11:54:08,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:54:08,572 INFO L432 NwaCegarLoop]: 1133 mSDtfsCounter, 1 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2949 SdHoareTripleChecker+Invalid, 2157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:08,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2949 Invalid, 2157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-13 11:54:08,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-10-13 11:54:08,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1243. [2024-10-13 11:54:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1243 states, 645 states have (on average 2.0) internal successors, (1290), 1234 states have internal predecessors, (1290), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 11:54:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1322 transitions. [2024-10-13 11:54:08,589 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1322 transitions. Word has length 53 [2024-10-13 11:54:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:08,590 INFO L471 AbstractCegarLoop]: Abstraction has 1243 states and 1322 transitions. [2024-10-13 11:54:08,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:54:08,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1322 transitions. [2024-10-13 11:54:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-13 11:54:08,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:08,591 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] [2024-10-13 11:54:08,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:08,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:08,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:08,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1642044960, now seen corresponding path program 1 times [2024-10-13 11:54:08,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:08,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179141292] [2024-10-13 11:54:08,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:08,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:08,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:08,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:08,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 11:54:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:09,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:54:09,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:54:09,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:54:09,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:09,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179141292] [2024-10-13 11:54:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179141292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:54:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:54:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:54:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619945481] [2024-10-13 11:54:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:54:09,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:54:09,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:09,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:54:09,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:54:09,079 INFO L87 Difference]: Start difference. First operand 1243 states and 1322 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-13 11:54:10,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:10,123 INFO L93 Difference]: Finished difference Result 1245 states and 1326 transitions. [2024-10-13 11:54:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:54:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2024-10-13 11:54:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:10,127 INFO L225 Difference]: With dead ends: 1245 [2024-10-13 11:54:10,127 INFO L226 Difference]: Without dead ends: 1245 [2024-10-13 11:54:10,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 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-13 11:54:10,128 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 0 mSDsluCounter, 2258 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3390 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:10,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3390 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 11:54:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-13 11:54:10,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1245. [2024-10-13 11:54:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 646 states have (on average 2.0) internal successors, (1292), 1236 states have internal predecessors, (1292), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:54:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1326 transitions. [2024-10-13 11:54:10,147 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1326 transitions. Word has length 59 [2024-10-13 11:54:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:10,147 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1326 transitions. [2024-10-13 11:54:10,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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-13 11:54:10,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1326 transitions. [2024-10-13 11:54:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-13 11:54:10,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:10,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:10,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:54:10,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:10,350 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:10,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:10,351 INFO L85 PathProgramCache]: Analyzing trace with hash -865659447, now seen corresponding path program 1 times [2024-10-13 11:54:10,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:10,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850257353] [2024-10-13 11:54:10,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:54:10,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:10,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:10,356 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:10,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 11:54:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:54:10,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:54:10,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:10,690 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-13 11:54:10,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:10,763 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-13 11:54:10,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:10,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850257353] [2024-10-13 11:54:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850257353] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:10,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:10,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:54:10,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212616622] [2024-10-13 11:54:10,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:10,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:54:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:10,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:54:10,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:54:10,768 INFO L87 Difference]: Start difference. First operand 1245 states and 1326 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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-13 11:54:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:12,062 INFO L93 Difference]: Finished difference Result 1254 states and 1341 transitions. [2024-10-13 11:54:12,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:54:12,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2024-10-13 11:54:12,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:12,066 INFO L225 Difference]: With dead ends: 1254 [2024-10-13 11:54:12,066 INFO L226 Difference]: Without dead ends: 1254 [2024-10-13 11:54:12,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 112 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-13 11:54:12,067 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 5 mSDsluCounter, 3382 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:12,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4512 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:54:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-13 11:54:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1253. [2024-10-13 11:54:12,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 653 states have (on average 1.998468606431853) internal successors, (1305), 1243 states have internal predecessors, (1305), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:54:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1339 transitions. [2024-10-13 11:54:12,085 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1339 transitions. Word has length 60 [2024-10-13 11:54:12,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:12,086 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1339 transitions. [2024-10-13 11:54:12,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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-13 11:54:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1339 transitions. [2024-10-13 11:54:12,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-13 11:54:12,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:12,087 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] [2024-10-13 11:54:12,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-10-13 11:54:12,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:12,291 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1411552288, now seen corresponding path program 2 times [2024-10-13 11:54:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972804853] [2024-10-13 11:54:12,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:54:12,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:12,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:12,296 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:12,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:54:12,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:54:12,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:54:12,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:54:12,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:12,803 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-13 11:54:12,804 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:12,974 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-13 11:54:12,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972804853] [2024-10-13 11:54:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972804853] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:12,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:12,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:54:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60781156] [2024-10-13 11:54:12,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:12,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:54:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:54:12,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:54:12,977 INFO L87 Difference]: Start difference. First operand 1253 states and 1339 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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-13 11:54:15,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:15,054 INFO L93 Difference]: Finished difference Result 1265 states and 1359 transitions. [2024-10-13 11:54:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:54:15,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 63 [2024-10-13 11:54:15,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:15,059 INFO L225 Difference]: With dead ends: 1265 [2024-10-13 11:54:15,059 INFO L226 Difference]: Without dead ends: 1263 [2024-10-13 11:54:15,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:54:15,060 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 8 mSDsluCounter, 5640 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6770 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:15,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6770 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:54:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2024-10-13 11:54:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1262. [2024-10-13 11:54:15,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 662 states have (on average 1.9894259818731117) internal successors, (1317), 1252 states have internal predecessors, (1317), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:54:15,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1351 transitions. [2024-10-13 11:54:15,092 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1351 transitions. Word has length 63 [2024-10-13 11:54:15,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:15,092 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1351 transitions. [2024-10-13 11:54:15,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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-13 11:54:15,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1351 transitions. [2024-10-13 11:54:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 11:54:15,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:15,094 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] [2024-10-13 11:54:15,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 11:54:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:15,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:15,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2099707008, now seen corresponding path program 3 times [2024-10-13 11:54:15,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:15,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661148033] [2024-10-13 11:54:15,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:54:15,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:15,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:15,297 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:15,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 11:54:15,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:54:15,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:54:15,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:54:15,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:16,045 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-13 11:54:16,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:16,509 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-13 11:54:16,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661148033] [2024-10-13 11:54:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661148033] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:16,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:16,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:54:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409721944] [2024-10-13 11:54:16,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:54:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:16,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:54:16,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:54:16,513 INFO L87 Difference]: Start difference. First operand 1262 states and 1351 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-13 11:54:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:21,760 INFO L93 Difference]: Finished difference Result 1283 states and 1387 transitions. [2024-10-13 11:54:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:54:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 69 [2024-10-13 11:54:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:21,765 INFO L225 Difference]: With dead ends: 1283 [2024-10-13 11:54:21,765 INFO L226 Difference]: Without dead ends: 1280 [2024-10-13 11:54:21,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 11:54:21,766 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 13 mSDsluCounter, 14654 mSDsCounter, 0 mSdLazyCounter, 2581 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 15784 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:21,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 15784 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2581 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 11:54:21,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2024-10-13 11:54:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1280. [2024-10-13 11:54:21,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 680 states have (on average 1.9705882352941178) internal successors, (1340), 1270 states have internal predecessors, (1340), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:54:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1374 transitions. [2024-10-13 11:54:21,784 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1374 transitions. Word has length 69 [2024-10-13 11:54:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:21,785 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1374 transitions. [2024-10-13 11:54:21,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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-13 11:54:21,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1374 transitions. [2024-10-13 11:54:21,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 11:54:21,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:21,786 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] [2024-10-13 11:54:21,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 11:54:21,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:21,987 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:21,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:21,987 INFO L85 PathProgramCache]: Analyzing trace with hash 163629632, now seen corresponding path program 4 times [2024-10-13 11:54:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:21,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171865202] [2024-10-13 11:54:21,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:54:21,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:21,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:21,990 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:21,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 11:54:22,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:54:22,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:54:22,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 11:54:22,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:22,782 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-13 11:54:22,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:23,962 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-13 11:54:23,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171865202] [2024-10-13 11:54:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171865202] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:54:23,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:54:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:54:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461700933] [2024-10-13 11:54:23,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:54:23,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:54:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:54:23,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:54:23,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:54:23,966 INFO L87 Difference]: Start difference. First operand 1280 states and 1374 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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-13 11:54:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:54:34,741 INFO L93 Difference]: Finished difference Result 1317 states and 1444 transitions. [2024-10-13 11:54:34,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:54:34,742 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2024-10-13 11:54:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:54:34,745 INFO L225 Difference]: With dead ends: 1317 [2024-10-13 11:54:34,745 INFO L226 Difference]: Without dead ends: 1315 [2024-10-13 11:54:34,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:54:34,748 INFO L432 NwaCegarLoop]: 1130 mSDtfsCounter, 26 mSDsluCounter, 25944 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27074 SdHoareTripleChecker+Invalid, 5504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:54:34,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27074 Invalid, 5504 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [123 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2024-10-13 11:54:34,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-13 11:54:34,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1314. [2024-10-13 11:54:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 714 states have (on average 1.9411764705882353) internal successors, (1386), 1304 states have internal predecessors, (1386), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 11:54:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1420 transitions. [2024-10-13 11:54:34,764 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1420 transitions. Word has length 81 [2024-10-13 11:54:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:54:34,764 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1420 transitions. [2024-10-13 11:54:34,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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-13 11:54:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1420 transitions. [2024-10-13 11:54:34,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-13 11:54:34,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:54:34,765 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:54:34,779 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-13 11:54:34,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:34,967 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 828 more)] === [2024-10-13 11:54:34,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:54:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash -163796320, now seen corresponding path program 5 times [2024-10-13 11:54:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:54:34,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550618945] [2024-10-13 11:54:34,968 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:54:34,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:54:34,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:54:34,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:54:34,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 11:54:36,208 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:54:36,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:54:36,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-13 11:54:36,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:54:36,259 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 11:54:36,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-10-13 11:54:36,675 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-10-13 11:54:36,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-10-13 11:54:36,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:54:36,899 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 42 treesize of output 24 [2024-10-13 11:54:39,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:54:39,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-13 11:54:39,611 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 51 treesize of output 27 [2024-10-13 11:54:39,691 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-13 11:54:39,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:54:40,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:54:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550618945] [2024-10-13 11:54:40,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550618945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:54:40,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1408698779] [2024-10-13 11:54:40,073 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:54:40,073 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:54:40,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:54:40,076 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:54:40,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process