./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_BER_test8-2.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_BER_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:47:30,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:47:30,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:47:30,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:47:30,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:47:30,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:47:30,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:47:30,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:47:30,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:47:30,904 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:47:30,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:47:30,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:47:30,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:47:30,907 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:47:30,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:47:30,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:47:30,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:47:30,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:47:30,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:47:30,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:47:30,909 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:47:30,909 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:47:30,913 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:47:30,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:47:30,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:47:30,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:47:30,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:47:30,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:47:30,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:47:30,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:47:30,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:47:30,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:47:30,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:47:30,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:30,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:47:30,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:47:30,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:47:30,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:47:30,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:47:30,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:47:30,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:47:30,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:47:30,918 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 -> fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c [2024-10-13 11:47:31,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:47:31,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:47:31,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:47:31,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:47:31,208 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:47:31,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-10-13 11:47:32,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:47:32,956 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:47:32,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-10-13 11:47:32,982 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cca2856/67dad2c94aed4c3e9c565332c4b8698b/FLAG4b3c70eb0 [2024-10-13 11:47:32,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/50cca2856/67dad2c94aed4c3e9c565332c4b8698b [2024-10-13 11:47:33,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:47:33,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:47:33,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:33,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:47:33,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:47:33,010 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:33" (1/1) ... [2024-10-13 11:47:33,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343cc6b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:33, skipping insertion in model container [2024-10-13 11:47:33,011 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:33" (1/1) ... [2024-10-13 11:47:33,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:33,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:33,674 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:47:33,678 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@50643b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:33, skipping insertion in model container [2024-10-13 11:47:33,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:33,679 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 11:47:33,681 INFO L158 Benchmark]: Toolchain (without parser) took 677.70ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 58.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 11:47:33,681 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 11:47:33,682 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.65ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 58.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-13 11:47:33,683 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.16ms. Allocated memory is still 113.2MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.65ms. Allocated memory is still 151.0MB. Free memory was 81.3MB in the beginning and 58.9MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_BER_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:47:35,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:47:35,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 11:47:35,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:47:35,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:47:35,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:47:35,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:47:35,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:47:35,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:47:35,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:47:35,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:47:35,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:47:35,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:47:35,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:47:35,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:47:35,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:47:35,980 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:47:35,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:47:35,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:47:35,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:47:35,982 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:47:35,985 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:47:35,985 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:47:35,985 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:47:35,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:47:35,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 11:47:35,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:47:35,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 11:47:35,989 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:47:35,989 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:47:35,989 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:47:35,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:47:35,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:47:35,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:47:35,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:47:35,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:35,991 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:47:35,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:47:35,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 11:47:35,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 11:47:35,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:47:35,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:47:35,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:47:35,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:47:35,994 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 11:47:35,994 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 -> fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c [2024-10-13 11:47:36,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:47:36,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:47:36,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:47:36,367 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:47:36,368 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:47:36,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-10-13 11:47:38,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:47:38,384 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:47:38,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-10-13 11:47:38,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f247e1d/ea73a8f779554759a26502cc0985be4a/FLAG305255851 [2024-10-13 11:47:38,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75f247e1d/ea73a8f779554759a26502cc0985be4a [2024-10-13 11:47:38,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:47:38,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:47:38,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:38,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:47:38,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:47:38,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:38" (1/1) ... [2024-10-13 11:47:38,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191134e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:38, skipping insertion in model container [2024-10-13 11:47:38,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:47:38" (1/1) ... [2024-10-13 11:47:38,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:39,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:39,298 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 11:47:39,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:47:39,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:39,418 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:47:39,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:47:39,569 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:47:39,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39 WrapperNode [2024-10-13 11:47:39,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:47:39,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:47:39,581 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:47:39,581 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:47:39,588 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:47:39" (1/1) ... [2024-10-13 11:47:39,633 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:47:39" (1/1) ... [2024-10-13 11:47:39,699 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-10-13 11:47:39,703 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:47:39,703 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:47:39,704 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:47:39,704 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:47:39,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,730 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,828 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 34, 268]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-10-13 11:47:39,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:47:39,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:47:39,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:47:39,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:47:39,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (1/1) ... [2024-10-13 11:47:39,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:47:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:47:39,990 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:47:39,992 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:47:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 11:47:40,028 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 11:47:40,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 11:47:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 11:47:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 11:47:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 11:47:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 11:47:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 11:47:40,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 11:47:40,029 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 11:47:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 11:47:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 11:47:40,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 11:47:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 11:47:40,030 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 11:47:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 11:47:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-13 11:47:40,031 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-13 11:47:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:47:40,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 11:47:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:47:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 11:47:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 11:47:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 11:47:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:47:40,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 11:47:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 11:47:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:47:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 11:47:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 11:47:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 11:47:40,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 11:47:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 11:47:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 11:47:40,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:47:40,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:47:40,275 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:47:40,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:47:40,297 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:40,336 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:40,366 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-13 11:47:44,439 INFO L? ?]: Removed 1322 outVars from TransFormulas that were not future-live. [2024-10-13 11:47:44,440 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:47:44,629 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:47:44,629 INFO L314 CfgBuilder]: Removed 71 assume(true) statements. [2024-10-13 11:47:44,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:44 BoogieIcfgContainer [2024-10-13 11:47:44,630 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:47:44,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:47:44,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:47:44,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:47:44,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:47:38" (1/3) ... [2024-10-13 11:47:44,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ad5946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:44, skipping insertion in model container [2024-10-13 11:47:44,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:47:39" (2/3) ... [2024-10-13 11:47:44,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ad5946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:47:44, skipping insertion in model container [2024-10-13 11:47:44,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:47:44" (3/3) ... [2024-10-13 11:47:44,640 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-2.i [2024-10-13 11:47:44,656 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:47:44,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2024-10-13 11:47:44,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:47:44,740 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;@261a73de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:47:44,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2024-10-13 11:47:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 1181 states, 523 states have (on average 2.5066921606118546) internal successors, (1311), 1171 states have internal predecessors, (1311), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:47:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:47:44,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:44,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:47:44,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:44,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:44,762 INFO L85 PathProgramCache]: Analyzing trace with hash 70318, now seen corresponding path program 1 times [2024-10-13 11:47:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:44,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539378674] [2024-10-13 11:47:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:44,774 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:47:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:44,778 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:47:44,780 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:47:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:45,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:47:45,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:45,060 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:47:45,074 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:47:45,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:45,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:45,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539378674] [2024-10-13 11:47:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539378674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:45,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:45,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:47:45,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755126555] [2024-10-13 11:47:45,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:45,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:45,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:45,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:45,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:45,122 INFO L87 Difference]: Start difference. First operand has 1181 states, 523 states have (on average 2.5066921606118546) internal successors, (1311), 1171 states have internal predecessors, (1311), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:46,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:46,898 INFO L93 Difference]: Finished difference Result 1348 states and 1455 transitions. [2024-10-13 11:47:46,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:46,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:47:46,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:46,917 INFO L225 Difference]: With dead ends: 1348 [2024-10-13 11:47:46,917 INFO L226 Difference]: Without dead ends: 1347 [2024-10-13 11:47:46,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:46,921 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 1048 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:46,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 901 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 11:47:46,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2024-10-13 11:47:47,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1171. [2024-10-13 11:47:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 529 states have (on average 2.3232514177693764) internal successors, (1229), 1160 states have internal predecessors, (1229), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 11:47:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1273 transitions. [2024-10-13 11:47:47,015 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1273 transitions. Word has length 2 [2024-10-13 11:47:47,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:47,016 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1273 transitions. [2024-10-13 11:47:47,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1273 transitions. [2024-10-13 11:47:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-13 11:47:47,019 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:47,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-13 11:47:47,024 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:47:47,222 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:47:47,222 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:47,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:47,223 INFO L85 PathProgramCache]: Analyzing trace with hash 70319, now seen corresponding path program 1 times [2024-10-13 11:47:47,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:47,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730365799] [2024-10-13 11:47:47,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:47,224 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:47:47,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:47,225 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:47:47,248 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:47:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:47,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:47:47,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:47,394 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:47:47,410 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:47:47,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:47,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:47,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730365799] [2024-10-13 11:47:47,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730365799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:47,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:47,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:47:47,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622442535] [2024-10-13 11:47:47,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:47,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:47,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:47,416 INFO L87 Difference]: Start difference. First operand 1171 states and 1273 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:49,824 INFO L93 Difference]: Finished difference Result 1720 states and 1865 transitions. [2024-10-13 11:47:49,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:49,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-13 11:47:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:49,831 INFO L225 Difference]: With dead ends: 1720 [2024-10-13 11:47:49,832 INFO L226 Difference]: Without dead ends: 1720 [2024-10-13 11:47:49,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:49,834 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 588 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:49,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1540 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 11:47:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-13 11:47:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 1348. [2024-10-13 11:47:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 706 states have (on average 2.2988668555240794) internal successors, (1623), 1336 states have internal predecessors, (1623), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:47:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1669 transitions. [2024-10-13 11:47:49,874 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1669 transitions. Word has length 2 [2024-10-13 11:47:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:49,875 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 1669 transitions. [2024-10-13 11:47:49,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1669 transitions. [2024-10-13 11:47:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 11:47:49,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:49,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 11:47:49,882 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 11:47:50,076 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:47:50,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 519002808, now seen corresponding path program 1 times [2024-10-13 11:47:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:50,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650599184] [2024-10-13 11:47:50,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:50,079 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:47:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:50,082 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:47:50,083 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:47:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:50,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:47:50,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:50,235 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:47:50,243 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:47:50,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:47:50,313 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:47:50,333 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:47:50,333 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:47:50,357 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:47:50,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:50,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:50,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650599184] [2024-10-13 11:47:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650599184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256028618] [2024-10-13 11:47:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:50,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:47:50,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:50,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:47:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:47:50,361 INFO L87 Difference]: Start difference. First operand 1348 states and 1669 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:53,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:53,008 INFO L93 Difference]: Finished difference Result 1518 states and 1846 transitions. [2024-10-13 11:47:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:47:53,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 11:47:53,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:53,016 INFO L225 Difference]: With dead ends: 1518 [2024-10-13 11:47:53,016 INFO L226 Difference]: Without dead ends: 1518 [2024-10-13 11:47:53,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:47:53,020 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 1340 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:53,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 583 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-13 11:47:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-10-13 11:47:53,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1159. [2024-10-13 11:47:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 529 states have (on average 2.298676748582231) internal successors, (1216), 1148 states have internal predecessors, (1216), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 11:47:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1260 transitions. [2024-10-13 11:47:53,054 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1260 transitions. Word has length 6 [2024-10-13 11:47:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:53,056 INFO L471 AbstractCegarLoop]: Abstraction has 1159 states and 1260 transitions. [2024-10-13 11:47:53,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1260 transitions. [2024-10-13 11:47:53,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:47:53,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:53,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:53,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 11:47:53,257 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:47:53,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:53,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:53,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1090782041, now seen corresponding path program 1 times [2024-10-13 11:47:53,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:53,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369241977] [2024-10-13 11:47:53,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:53,259 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:47:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:53,263 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:47:53,265 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:47:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:53,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:47:53,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:53,428 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:47:53,439 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:47:53,439 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:53,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:53,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369241977] [2024-10-13 11:47:53,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369241977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:53,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966239727] [2024-10-13 11:47:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:53,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:53,441 INFO L87 Difference]: Start difference. First operand 1159 states and 1260 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:55,123 INFO L93 Difference]: Finished difference Result 1459 states and 1589 transitions. [2024-10-13 11:47:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:55,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:47:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:55,129 INFO L225 Difference]: With dead ends: 1459 [2024-10-13 11:47:55,130 INFO L226 Difference]: Without dead ends: 1459 [2024-10-13 11:47:55,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:55,132 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 842 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:55,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1372 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:47:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-13 11:47:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1111. [2024-10-13 11:47:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 529 states have (on average 2.2060491493383743) internal successors, (1167), 1100 states have internal predecessors, (1167), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-13 11:47:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1211 transitions. [2024-10-13 11:47:55,160 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1211 transitions. Word has length 7 [2024-10-13 11:47:55,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:55,161 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1211 transitions. [2024-10-13 11:47:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1211 transitions. [2024-10-13 11:47:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:47:55,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:55,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:55,170 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:47:55,365 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:47:55,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:55,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1090782040, now seen corresponding path program 1 times [2024-10-13 11:47:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:55,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761219746] [2024-10-13 11:47:55,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:55,367 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:47:55,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:55,370 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:47:55,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 11:47:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:55,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:47:55,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:55,503 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:47:55,531 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:47:55,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:55,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:55,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761219746] [2024-10-13 11:47:55,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761219746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:55,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:55,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:55,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564633468] [2024-10-13 11:47:55,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:55,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:55,535 INFO L87 Difference]: Start difference. First operand 1111 states and 1211 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:57,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:57,723 INFO L93 Difference]: Finished difference Result 1546 states and 1682 transitions. [2024-10-13 11:47:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-13 11:47:57,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:57,731 INFO L225 Difference]: With dead ends: 1546 [2024-10-13 11:47:57,731 INFO L226 Difference]: Without dead ends: 1546 [2024-10-13 11:47:57,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:57,733 INFO L432 NwaCegarLoop]: 1186 mSDtfsCounter, 633 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:57,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 1686 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-13 11:47:57,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2024-10-13 11:47:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1319. [2024-10-13 11:47:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 745 states have (on average 2.1865771812080537) internal successors, (1629), 1306 states have internal predecessors, (1629), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-13 11:47:57,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1677 transitions. [2024-10-13 11:47:57,766 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1677 transitions. Word has length 7 [2024-10-13 11:47:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:57,767 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1677 transitions. [2024-10-13 11:47:57,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:47:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1677 transitions. [2024-10-13 11:47:57,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 11:47:57,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:57,768 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:57,773 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:47:57,971 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:47:57,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:57,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash -709812944, now seen corresponding path program 1 times [2024-10-13 11:47:57,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:57,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795676515] [2024-10-13 11:47:57,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:57,973 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:47:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:57,974 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:47:57,975 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:47:58,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:58,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:47:58,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:58,167 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:47:58,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:58,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:58,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795676515] [2024-10-13 11:47:58,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795676515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:58,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:47:58,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988403277] [2024-10-13 11:47:58,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:58,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:58,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:58,169 INFO L87 Difference]: Start difference. First operand 1319 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:47:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:47:59,065 INFO L93 Difference]: Finished difference Result 1998 states and 2612 transitions. [2024-10-13 11:47:59,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:47:59,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:47:59,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:47:59,072 INFO L225 Difference]: With dead ends: 1998 [2024-10-13 11:47:59,072 INFO L226 Difference]: Without dead ends: 1998 [2024-10-13 11:47:59,073 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:47:59,073 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 572 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:47:59,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 2122 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 11:47:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2024-10-13 11:47:59,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1654. [2024-10-13 11:47:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1078 states have (on average 2.170686456400742) internal successors, (2340), 1639 states have internal predecessors, (2340), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:47:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 2392 transitions. [2024-10-13 11:47:59,109 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 2392 transitions. Word has length 10 [2024-10-13 11:47:59,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:47:59,109 INFO L471 AbstractCegarLoop]: Abstraction has 1654 states and 2392 transitions. [2024-10-13 11:47:59,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 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:47:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 2392 transitions. [2024-10-13 11:47:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:47:59,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:47:59,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:47:59,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 11:47:59,310 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:47:59,310 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:47:59,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:47:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash 170345729, now seen corresponding path program 1 times [2024-10-13 11:47:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:47:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036259381] [2024-10-13 11:47:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:47:59,311 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:47:59,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:47:59,315 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:47:59,316 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:47:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:47:59,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:47:59,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:47:59,466 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:47:59,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:47:59,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:47:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036259381] [2024-10-13 11:47:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036259381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:47:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:47:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:47:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173291668] [2024-10-13 11:47:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:47:59,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:47:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:47:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:47:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:47:59,469 INFO L87 Difference]: Start difference. First operand 1654 states and 2392 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:48:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:00,081 INFO L93 Difference]: Finished difference Result 1570 states and 2232 transitions. [2024-10-13 11:48:00,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:00,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:48:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:00,087 INFO L225 Difference]: With dead ends: 1570 [2024-10-13 11:48:00,087 INFO L226 Difference]: Without dead ends: 1570 [2024-10-13 11:48:00,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:48:00,089 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 61 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1994 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:00,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1994 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:48:00,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-13 11:48:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-10-13 11:48:00,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1018 states have (on average 2.1414538310412574) internal successors, (2180), 1555 states have internal predecessors, (2180), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2232 transitions. [2024-10-13 11:48:00,122 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2232 transitions. Word has length 12 [2024-10-13 11:48:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:00,122 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2232 transitions. [2024-10-13 11:48:00,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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:48:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2232 transitions. [2024-10-13 11:48:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 11:48:00,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:00,124 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:00,128 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:48:00,326 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:48:00,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr632ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:00,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1905928002, now seen corresponding path program 1 times [2024-10-13 11:48:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:00,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953654617] [2024-10-13 11:48:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:00,328 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:48:00,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:00,329 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:48:00,330 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:48:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:00,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:48:00,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:00,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:00,493 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:00,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:48:00,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-13 11:48:00,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:48:00,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-13 11:48:00,565 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:48:00,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:00,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:00,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953654617] [2024-10-13 11:48:00,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953654617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:00,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:00,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333860568] [2024-10-13 11:48:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:00,567 INFO L87 Difference]: Start difference. First operand 1570 states and 2232 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:01,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:01,820 INFO L93 Difference]: Finished difference Result 2774 states and 3844 transitions. [2024-10-13 11:48:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-13 11:48:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:01,827 INFO L225 Difference]: With dead ends: 2774 [2024-10-13 11:48:01,828 INFO L226 Difference]: Without dead ends: 2774 [2024-10-13 11:48:01,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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:48:01,828 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1017 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:01,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 3043 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:48:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2024-10-13 11:48:01,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 1569. [2024-10-13 11:48:01,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1017 states have (on average 2.1415929203539825) internal successors, (2178), 1554 states have internal predecessors, (2178), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:01,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2230 transitions. [2024-10-13 11:48:01,875 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2230 transitions. Word has length 13 [2024-10-13 11:48:01,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:01,875 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2230 transitions. [2024-10-13 11:48:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:01,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2230 transitions. [2024-10-13 11:48:01,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 11:48:01,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:01,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:01,882 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:48:02,076 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:48:02,077 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash -249532353, now seen corresponding path program 1 times [2024-10-13 11:48:02,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:02,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729518701] [2024-10-13 11:48:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:02,078 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:48:02,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:02,079 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:48:02,081 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:48:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:02,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 11:48:02,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:02,240 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:48:02,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:02,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:02,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729518701] [2024-10-13 11:48:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729518701] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599276727] [2024-10-13 11:48:02,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:02,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:48:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:02,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:48:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:48:02,243 INFO L87 Difference]: Start difference. First operand 1569 states and 2230 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:48:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:02,783 INFO L93 Difference]: Finished difference Result 1515 states and 2150 transitions. [2024-10-13 11:48:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:48:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2024-10-13 11:48:02,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:02,789 INFO L225 Difference]: With dead ends: 1515 [2024-10-13 11:48:02,789 INFO L226 Difference]: Without dead ends: 1515 [2024-10-13 11:48:02,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:48:02,791 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 61 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1920 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:02,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1920 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 11:48:02,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2024-10-13 11:48:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1515. [2024-10-13 11:48:02,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 987 states have (on average 2.125633232016211) internal successors, (2098), 1500 states have internal predecessors, (2098), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:02,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2150 transitions. [2024-10-13 11:48:02,818 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2150 transitions. Word has length 15 [2024-10-13 11:48:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:02,818 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2150 transitions. [2024-10-13 11:48:02,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 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:48:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2150 transitions. [2024-10-13 11:48:02,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-13 11:48:02,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:02,819 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:02,826 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:48:03,020 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:48:03,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:03,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:03,021 INFO L85 PathProgramCache]: Analyzing trace with hash 717576632, now seen corresponding path program 1 times [2024-10-13 11:48:03,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:03,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352330136] [2024-10-13 11:48:03,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:03,021 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:48:03,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:03,024 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:48:03,025 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:48:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:03,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:03,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:03,210 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:48:03,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:03,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:03,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352330136] [2024-10-13 11:48:03,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352330136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:03,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:03,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:03,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084438949] [2024-10-13 11:48:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:03,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:03,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:03,213 INFO L87 Difference]: Start difference. First operand 1515 states and 2150 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:03,998 INFO L93 Difference]: Finished difference Result 1499 states and 2106 transitions. [2024-10-13 11:48:04,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:04,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-13 11:48:04,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:04,004 INFO L225 Difference]: With dead ends: 1499 [2024-10-13 11:48:04,004 INFO L226 Difference]: Without dead ends: 1499 [2024-10-13 11:48:04,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:48:04,005 INFO L432 NwaCegarLoop]: 950 mSDtfsCounter, 45 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2832 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:04,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2832 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 11:48:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2024-10-13 11:48:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499. [2024-10-13 11:48:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 985 states have (on average 2.085279187817259) internal successors, (2054), 1484 states have internal predecessors, (2054), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2106 transitions. [2024-10-13 11:48:04,028 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2106 transitions. Word has length 17 [2024-10-13 11:48:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:04,028 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 2106 transitions. [2024-10-13 11:48:04,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:48:04,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2106 transitions. [2024-10-13 11:48:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:48:04,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:04,029 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] [2024-10-13 11:48:04,036 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:48:04,233 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:48:04,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:04,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:04,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2015839738, now seen corresponding path program 1 times [2024-10-13 11:48:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234777874] [2024-10-13 11:48:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:04,235 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:48:04,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:04,236 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:48:04,237 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:48:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:04,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:04,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:04,429 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:48:04,497 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:48:04,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:04,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234777874] [2024-10-13 11:48:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234777874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:04,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:04,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:04,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623197337] [2024-10-13 11:48:04,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:04,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:04,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:04,500 INFO L87 Difference]: Start difference. First operand 1499 states and 2106 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:48:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:05,970 INFO L93 Difference]: Finished difference Result 1516 states and 2122 transitions. [2024-10-13 11:48:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-13 11:48:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:05,974 INFO L225 Difference]: With dead ends: 1516 [2024-10-13 11:48:05,974 INFO L226 Difference]: Without dead ends: 1516 [2024-10-13 11:48:05,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:48:05,975 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 744 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 1190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:05,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1292 Invalid, 1190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:48:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-10-13 11:48:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1495. [2024-10-13 11:48:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 985 states have (on average 2.0771573604060913) internal successors, (2046), 1480 states have internal predecessors, (2046), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 2098 transitions. [2024-10-13 11:48:05,996 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 2098 transitions. Word has length 31 [2024-10-13 11:48:05,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:05,996 INFO L471 AbstractCegarLoop]: Abstraction has 1495 states and 2098 transitions. [2024-10-13 11:48:05,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:48:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 2098 transitions. [2024-10-13 11:48:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 11:48:05,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:05,997 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] [2024-10-13 11:48:06,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 (12)] Ended with exit code 0 [2024-10-13 11:48:06,201 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:48:06,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:06,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:06,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2015839737, now seen corresponding path program 1 times [2024-10-13 11:48:06,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:06,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603556223] [2024-10-13 11:48:06,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:06,207 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:48:06,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 11:48:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:06,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 11:48:06,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:06,416 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:48:06,617 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:48:06,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:06,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:06,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603556223] [2024-10-13 11:48:06,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603556223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:06,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:06,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:06,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639148127] [2024-10-13 11:48:06,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:06,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:06,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:06,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:06,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:06,619 INFO L87 Difference]: Start difference. First operand 1495 states and 2098 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:48:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:09,191 INFO L93 Difference]: Finished difference Result 1703 states and 2104 transitions. [2024-10-13 11:48:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2024-10-13 11:48:09,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:09,197 INFO L225 Difference]: With dead ends: 1703 [2024-10-13 11:48:09,197 INFO L226 Difference]: Without dead ends: 1703 [2024-10-13 11:48:09,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:48:09,198 INFO L432 NwaCegarLoop]: 1169 mSDtfsCounter, 531 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 1575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:09,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 2401 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1575 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-13 11:48:09,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-10-13 11:48:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1491. [2024-10-13 11:48:09,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1491 states, 985 states have (on average 2.0690355329949237) internal successors, (2038), 1476 states have internal predecessors, (2038), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1491 states to 1491 states and 2090 transitions. [2024-10-13 11:48:09,222 INFO L78 Accepts]: Start accepts. Automaton has 1491 states and 2090 transitions. Word has length 31 [2024-10-13 11:48:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:09,223 INFO L471 AbstractCegarLoop]: Abstraction has 1491 states and 2090 transitions. [2024-10-13 11:48:09,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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:48:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1491 states and 2090 transitions. [2024-10-13 11:48:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-13 11:48:09,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:09,224 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] [2024-10-13 11:48:09,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 11:48:09,424 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:48:09,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:09,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:09,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1732169696, now seen corresponding path program 1 times [2024-10-13 11:48:09,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:09,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6608019] [2024-10-13 11:48:09,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:09,426 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:48:09,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:09,429 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:48:09,431 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:48:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:09,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:09,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:09,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:09,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:09,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:09,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6608019] [2024-10-13 11:48:09,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6608019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866333732] [2024-10-13 11:48:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:09,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:09,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:09,713 INFO L87 Difference]: Start difference. First operand 1491 states and 2090 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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:48:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:10,378 INFO L93 Difference]: Finished difference Result 1479 states and 2070 transitions. [2024-10-13 11:48:10,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:48:10,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2024-10-13 11:48:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:10,383 INFO L225 Difference]: With dead ends: 1479 [2024-10-13 11:48:10,383 INFO L226 Difference]: Without dead ends: 1479 [2024-10-13 11:48:10,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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:48:10,384 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 15 mSDsluCounter, 1871 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:10,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2815 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:48:10,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2024-10-13 11:48:10,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1479. [2024-10-13 11:48:10,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1479 states, 973 states have (on average 2.0739979445015417) internal successors, (2018), 1464 states have internal predecessors, (2018), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 11:48:10,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1479 states to 1479 states and 2070 transitions. [2024-10-13 11:48:10,402 INFO L78 Accepts]: Start accepts. Automaton has 1479 states and 2070 transitions. Word has length 50 [2024-10-13 11:48:10,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:10,402 INFO L471 AbstractCegarLoop]: Abstraction has 1479 states and 2070 transitions. [2024-10-13 11:48:10,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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:48:10,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2070 transitions. [2024-10-13 11:48:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-13 11:48:10,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:10,404 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] [2024-10-13 11:48:10,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 11:48:10,604 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:48:10,605 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:10,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:10,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1191760002, now seen corresponding path program 1 times [2024-10-13 11:48:10,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:10,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693923981] [2024-10-13 11:48:10,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:10,606 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:48:10,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:10,609 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:48:10,610 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:48:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:10,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 11:48:10,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:10,918 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:48:10,924 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:48:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:48:11,391 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:48:11,404 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 11:48:11,404 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:48:11,419 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:48:11,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:11,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:11,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693923981] [2024-10-13 11:48:11,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693923981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:11,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:11,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:48:11,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96787247] [2024-10-13 11:48:11,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:11,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:11,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:11,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:11,420 INFO L87 Difference]: Start difference. First operand 1479 states and 2070 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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:48:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:13,074 INFO L93 Difference]: Finished difference Result 1452 states and 2044 transitions. [2024-10-13 11:48:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2024-10-13 11:48:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:13,079 INFO L225 Difference]: With dead ends: 1452 [2024-10-13 11:48:13,079 INFO L226 Difference]: Without dead ends: 1452 [2024-10-13 11:48:13,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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:48:13,080 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 695 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:13,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 735 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 11:48:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-13 11:48:13,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1120. [2024-10-13 11:48:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 657 states have (on average 1.9710806697108068) internal successors, (1295), 1108 states have internal predecessors, (1295), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:48:13,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1341 transitions. [2024-10-13 11:48:13,096 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1341 transitions. Word has length 54 [2024-10-13 11:48:13,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:13,097 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1341 transitions. [2024-10-13 11:48:13,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 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:48:13,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1341 transitions. [2024-10-13 11:48:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 11:48:13,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:13,098 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] [2024-10-13 11:48:13,109 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:48:13,298 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:48:13,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:13,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:13,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1643354685, now seen corresponding path program 1 times [2024-10-13 11:48:13,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:13,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599857997] [2024-10-13 11:48:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:13,300 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:48:13,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:13,302 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:48:13,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 11:48:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:13,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:48:13,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:13,551 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:48:13,564 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:48:13,590 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:48:13,602 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:48:13,602 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:13,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:13,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599857997] [2024-10-13 11:48:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599857997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044929169] [2024-10-13 11:48:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:13,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:48:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:48:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:13,604 INFO L87 Difference]: Start difference. First operand 1120 states and 1341 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:15,590 INFO L93 Difference]: Finished difference Result 1119 states and 1340 transitions. [2024-10-13 11:48:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:15,591 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-13 11:48:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:15,593 INFO L225 Difference]: With dead ends: 1119 [2024-10-13 11:48:15,593 INFO L226 Difference]: Without dead ends: 1119 [2024-10-13 11:48:15,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:48:15,594 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2465 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:15,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2465 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1623 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 11:48:15,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-10-13 11:48:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2024-10-13 11:48:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 657 states have (on average 1.969558599695586) internal successors, (1294), 1107 states have internal predecessors, (1294), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:48:15,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1340 transitions. [2024-10-13 11:48:15,606 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1340 transitions. Word has length 58 [2024-10-13 11:48:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:15,606 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1340 transitions. [2024-10-13 11:48:15,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:15,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1340 transitions. [2024-10-13 11:48:15,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-13 11:48:15,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,616 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:48:15,811 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:48:15,812 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:15,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1643354686, now seen corresponding path program 1 times [2024-10-13 11:48:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597834650] [2024-10-13 11:48:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:15,813 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:48:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:15,814 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:48:15,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 (17)] Waiting until timeout for monitored process [2024-10-13 11:48:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:16,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 11:48:16,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:16,055 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:48:16,072 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:48:16,087 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:48:16,129 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:48:16,145 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:48:16,146 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:16,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597834650] [2024-10-13 11:48:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597834650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:16,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001626584] [2024-10-13 11:48:16,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:16,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:48:16,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:16,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:48:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:48:16,147 INFO L87 Difference]: Start difference. First operand 1119 states and 1340 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:18,216 INFO L93 Difference]: Finished difference Result 1118 states and 1339 transitions. [2024-10-13 11:48:18,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:48:18,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-10-13 11:48:18,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:18,219 INFO L225 Difference]: With dead ends: 1118 [2024-10-13 11:48:18,220 INFO L226 Difference]: Without dead ends: 1118 [2024-10-13 11:48:18,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 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:48:18,220 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 1 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2519 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 11:48:18,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-10-13 11:48:18,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2024-10-13 11:48:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 656 states have (on average 1.9710365853658536) internal successors, (1293), 1106 states have internal predecessors, (1293), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 11:48:18,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1339 transitions. [2024-10-13 11:48:18,231 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1339 transitions. Word has length 58 [2024-10-13 11:48:18,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:18,231 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1339 transitions. [2024-10-13 11:48:18,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:18,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1339 transitions. [2024-10-13 11:48:18,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 11:48:18,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:18,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:18,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:18,433 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:48:18,433 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 848136961, now seen corresponding path program 1 times [2024-10-13 11:48:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103225900] [2024-10-13 11:48:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:18,434 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:48:18,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:18,438 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:48:18,439 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:48:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:18,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:48:18,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:48:18,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 11:48:18,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103225900] [2024-10-13 11:48:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103225900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:48:18,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:48:18,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:48:18,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105592869] [2024-10-13 11:48:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:48:18,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:48:18,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:18,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:48:18,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:48:18,711 INFO L87 Difference]: Start difference. First operand 1118 states and 1339 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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:48:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:19,304 INFO L93 Difference]: Finished difference Result 1120 states and 1342 transitions. [2024-10-13 11:48:19,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:48:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-13 11:48:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:19,310 INFO L225 Difference]: With dead ends: 1120 [2024-10-13 11:48:19,310 INFO L226 Difference]: Without dead ends: 1120 [2024-10-13 11:48:19,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 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:48:19,311 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 0 mSDsluCounter, 1829 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:19,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2745 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 11:48:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2024-10-13 11:48:19,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1120. [2024-10-13 11:48:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 657 states have (on average 1.9710806697108068) internal successors, (1295), 1108 states have internal predecessors, (1295), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:48:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1342 transitions. [2024-10-13 11:48:19,339 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1342 transitions. Word has length 64 [2024-10-13 11:48:19,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:19,339 INFO L471 AbstractCegarLoop]: Abstraction has 1120 states and 1342 transitions. [2024-10-13 11:48:19,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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:48:19,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1342 transitions. [2024-10-13 11:48:19,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 11:48:19,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:19,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:19,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:19,540 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:48:19,541 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1054045331, now seen corresponding path program 1 times [2024-10-13 11:48:19,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:19,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19665857] [2024-10-13 11:48:19,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:48:19,542 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:48:19,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:19,546 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:48:19,547 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:48:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:48:19,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 11:48:19,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:19,851 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:48:19,852 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:19,924 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:48:19,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:19,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19665857] [2024-10-13 11:48:19,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19665857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:19,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:19,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 11:48:19,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214234943] [2024-10-13 11:48:19,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:19,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:48:19,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:19,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:48:19,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:48:19,932 INFO L87 Difference]: Start difference. First operand 1120 states and 1342 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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:48:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:21,147 INFO L93 Difference]: Finished difference Result 1129 states and 1356 transitions. [2024-10-13 11:48:21,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 11:48:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2024-10-13 11:48:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:21,151 INFO L225 Difference]: With dead ends: 1129 [2024-10-13 11:48:21,152 INFO L226 Difference]: Without dead ends: 1129 [2024-10-13 11:48:21,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 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:48:21,154 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 4 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5481 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:21,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5481 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 11:48:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2024-10-13 11:48:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1128. [2024-10-13 11:48:21,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 664 states have (on average 1.9698795180722892) internal successors, (1308), 1115 states have internal predecessors, (1308), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:48:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1355 transitions. [2024-10-13 11:48:21,177 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1355 transitions. Word has length 65 [2024-10-13 11:48:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:21,178 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1355 transitions. [2024-10-13 11:48:21,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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:48:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1355 transitions. [2024-10-13 11:48:21,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 11:48:21,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:21,179 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:21,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:21,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:21,380 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:21,380 INFO L85 PathProgramCache]: Analyzing trace with hash 159670145, now seen corresponding path program 2 times [2024-10-13 11:48:21,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111702759] [2024-10-13 11:48:21,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 11:48:21,381 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:48:21,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:21,382 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:21,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-13 11:48:21,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 11:48:21,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:21,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 11:48:21,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:21,827 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:48:21,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:21,961 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:48:21,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111702759] [2024-10-13 11:48:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111702759] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:21,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:21,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 11:48:21,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594198449] [2024-10-13 11:48:21,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 11:48:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 11:48:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 11:48:21,965 INFO L87 Difference]: Start difference. First operand 1128 states and 1355 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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:48:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:23,527 INFO L93 Difference]: Finished difference Result 1140 states and 1374 transitions. [2024-10-13 11:48:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:48:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2024-10-13 11:48:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:23,532 INFO L225 Difference]: With dead ends: 1140 [2024-10-13 11:48:23,532 INFO L226 Difference]: Without dead ends: 1138 [2024-10-13 11:48:23,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 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:48:23,537 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 7 mSDsluCounter, 5482 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 6397 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:23,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 6397 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 11:48:23,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2024-10-13 11:48:23,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1137. [2024-10-13 11:48:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 673 states have (on average 1.9613670133729568) internal successors, (1320), 1124 states have internal predecessors, (1320), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:48:23,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1367 transitions. [2024-10-13 11:48:23,555 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1367 transitions. Word has length 68 [2024-10-13 11:48:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:23,556 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1367 transitions. [2024-10-13 11:48:23,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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:48:23,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1367 transitions. [2024-10-13 11:48:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-13 11:48:23,557 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:23,557 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:23,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-13 11:48:23,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:23,758 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 310634049, now seen corresponding path program 3 times [2024-10-13 11:48:23,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:23,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [720083610] [2024-10-13 11:48:23,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 11:48:23,759 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:48:23,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:23,760 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:23,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-13 11:48:24,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-13 11:48:24,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:24,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 11:48:24,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:24,522 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:48:24,522 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:24,960 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:48:24,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:24,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [720083610] [2024-10-13 11:48:24,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [720083610] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:24,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:24,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 11:48:24,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984002483] [2024-10-13 11:48:24,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:24,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 11:48:24,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:24,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 11:48:24,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:48:24,962 INFO L87 Difference]: Start difference. First operand 1137 states and 1367 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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:48:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:28,667 INFO L93 Difference]: Finished difference Result 1158 states and 1403 transitions. [2024-10-13 11:48:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 11:48:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2024-10-13 11:48:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:28,670 INFO L225 Difference]: With dead ends: 1158 [2024-10-13 11:48:28,670 INFO L226 Difference]: Without dead ends: 1155 [2024-10-13 11:48:28,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 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:48:28,671 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 14 mSDsluCounter, 10965 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11880 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:28,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11880 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 11:48:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-10-13 11:48:28,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2024-10-13 11:48:28,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 691 states have (on average 1.9435600578871202) internal successors, (1343), 1142 states have internal predecessors, (1343), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:48:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1390 transitions. [2024-10-13 11:48:28,686 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1390 transitions. Word has length 74 [2024-10-13 11:48:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:28,687 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1390 transitions. [2024-10-13 11:48:28,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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:48:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1390 transitions. [2024-10-13 11:48:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-13 11:48:28,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:28,688 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:28,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-13 11:48:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:28,889 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:28,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1243530177, now seen corresponding path program 4 times [2024-10-13 11:48:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:28,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [520627323] [2024-10-13 11:48:28,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 11:48:28,891 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:48:28,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:28,894 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:28,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-13 11:48:29,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 11:48:29,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:29,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 11:48:29,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:29,826 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:48:29,826 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:31,144 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:48:31,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:31,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [520627323] [2024-10-13 11:48:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [520627323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:48:31,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 11:48:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 11:48:31,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697759894] [2024-10-13 11:48:31,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 11:48:31,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 11:48:31,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 11:48:31,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 11:48:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 11:48:31,148 INFO L87 Difference]: Start difference. First operand 1155 states and 1390 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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:48:40,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:48:40,516 INFO L93 Difference]: Finished difference Result 1192 states and 1459 transitions. [2024-10-13 11:48:40,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 11:48:40,517 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2024-10-13 11:48:40,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:48:40,520 INFO L225 Difference]: With dead ends: 1192 [2024-10-13 11:48:40,520 INFO L226 Difference]: Without dead ends: 1190 [2024-10-13 11:48:40,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 11:48:40,523 INFO L432 NwaCegarLoop]: 915 mSDtfsCounter, 26 mSDsluCounter, 21008 mSDsCounter, 0 mSdLazyCounter, 4412 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 21923 SdHoareTripleChecker+Invalid, 4445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 4412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:48:40,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 21923 Invalid, 4445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 4412 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-13 11:48:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-10-13 11:48:40,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1189. [2024-10-13 11:48:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1189 states, 725 states have (on average 1.9158620689655173) internal successors, (1389), 1176 states have internal predecessors, (1389), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-13 11:48:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 1436 transitions. [2024-10-13 11:48:40,539 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 1436 transitions. Word has length 86 [2024-10-13 11:48:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:48:40,539 INFO L471 AbstractCegarLoop]: Abstraction has 1189 states and 1436 transitions. [2024-10-13 11:48:40,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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:48:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 1436 transitions. [2024-10-13 11:48:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 11:48:40,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:48:40,540 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:48:40,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-13 11:48:40,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 11:48:40,741 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2024-10-13 11:48:40,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:48:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1839787137, now seen corresponding path program 5 times [2024-10-13 11:48:40,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 11:48:40,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154900472] [2024-10-13 11:48:40,742 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:48:40,742 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:48:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 11:48:40,744 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 11:48:40,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-13 11:48:41,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-13 11:48:41,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 11:48:41,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-13 11:48:41,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:48:41,919 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:48:41,997 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-13 11:48:41,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-13 11:48:42,036 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:48:42,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-13 11:48:43,069 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-13 11:48:43,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-13 11:48:43,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-13 11:48:43,148 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:48:43,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:48:43,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 11:48:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154900472] [2024-10-13 11:48:43,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154900472] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:48:43,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1663065792] [2024-10-13 11:48:43,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 11:48:43,468 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 11:48:43,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 11:48:43,471 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 11:48:43,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process