./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_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:03:19,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:03:19,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:03:19,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:03:19,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:03:19,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:03:19,156 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:03:19,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:03:19,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:03:19,159 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:03:19,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:03:19,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:03:19,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:03:19,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:03:19,161 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:03:19,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:03:19,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:03:19,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:03:19,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:03:19,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:03:19,164 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:03:19,168 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:03:19,169 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:03:19,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:03:19,169 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:03:19,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:03:19,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:03:19,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:03:19,170 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:03:19,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:03:19,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:03:19,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:03:19,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:03:19,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:03:19,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:03:19,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:03:19,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:03:19,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:03:19,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:03:19,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:03:19,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:03:19,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:03:19,174 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-clean/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-clean/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 -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2024-10-11 19:03:19,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:03:19,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:03:19,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:03:19,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:03:19,504 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:03:19,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-11 19:03:20,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:03:21,315 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:03:21,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-11 19:03:21,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98a01caa4/97aad3a4bd8e415bba73c11cae86cb35/FLAG037408b8c [2024-10-11 19:03:21,353 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/98a01caa4/97aad3a4bd8e415bba73c11cae86cb35 [2024-10-11 19:03:21,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:03:21,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:03:21,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:03:21,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:03:21,366 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:03:21,367 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:21" (1/1) ... [2024-10-11 19:03:21,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5918935b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:21, skipping insertion in model container [2024-10-11 19:03:21,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:21" (1/1) ... [2024-10-11 19:03:21,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:03:22,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:03:22,022 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-11 19:03:22,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5f680129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:22, skipping insertion in model container [2024-10-11 19:03:22,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:03:22,024 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:03:22,027 INFO L158 Benchmark]: Toolchain (without parser) took 667.78ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 85.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:03:22,027 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:03:22,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.18ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 85.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 19:03:22,030 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.18ms. Allocated memory is still 167.8MB. Free memory was 106.5MB in the beginning and 85.5MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:03:24,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:03:24,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:03:24,236 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:03:24,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:03:24,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:03:24,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:03:24,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:03:24,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:03:24,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:03:24,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:03:24,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:03:24,269 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:03:24,272 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:03:24,273 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:03:24,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:03:24,274 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:03:24,274 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:03:24,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:03:24,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:03:24,275 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:03:24,276 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:03:24,276 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:03:24,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:03:24,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:03:24,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:03:24,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:03:24,278 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:03:24,278 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:03:24,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:03:24,279 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:03:24,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:03:24,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:03:24,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:03:24,280 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:03:24,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:03:24,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:03:24,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:03:24,282 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:03:24,282 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:03:24,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:03:24,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:03:24,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:03:24,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:03:24,284 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:03:24,284 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-clean/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-clean/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 -> f0735ebc421a940bb70b06777060abaef432af6ff0cfdeb82bfa2e45a81b4e11 [2024-10-11 19:03:24,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:03:24,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:03:24,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:03:24,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:03:24,681 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:03:24,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-11 19:03:26,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:03:26,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:03:26,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test2-1.i [2024-10-11 19:03:26,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce22f9890/04bb9015afa84032a04937df92b46335/FLAG59217eb3f [2024-10-11 19:03:26,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce22f9890/04bb9015afa84032a04937df92b46335 [2024-10-11 19:03:26,871 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:03:26,872 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:03:26,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:03:26,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:03:26,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:03:26,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:26" (1/1) ... [2024-10-11 19:03:26,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6cf9b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:26, skipping insertion in model container [2024-10-11 19:03:26,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:03:26" (1/1) ... [2024-10-11 19:03:26,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:03:27,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:03:27,524 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:03:27,536 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:03:27,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:03:27,658 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:03:27,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:03:27,818 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:03:27,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27 WrapperNode [2024-10-11 19:03:27,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:03:27,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:03:27,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:03:27,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:03:27,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:27,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:27,924 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 915 [2024-10-11 19:03:27,925 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:03:27,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:03:27,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:03:27,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:03:27,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:27,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:27,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,003 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-10-11 19:03:28,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,059 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,064 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,074 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:03:28,075 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:03:28,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:03:28,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:03:28,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (1/1) ... [2024-10-11 19:03:28,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:03:28,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:03:28,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:03:28,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 19:03:28,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:03:28,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 19:03:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 19:03:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 19:03:28,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 19:03:28,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 19:03:28,169 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 19:03:28,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:03:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 19:03:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 19:03:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 19:03:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:03:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:03:28,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:03:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:03:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:03:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:03:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:03:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 19:03:28,171 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 19:03:28,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 19:03:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:03:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:03:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:03:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:03:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:03:28,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:03:28,397 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:03:28,399 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:03:28,431 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:03:28,469 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:03:28,495 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-11 19:03:32,161 INFO L? ?]: Removed 878 outVars from TransFormulas that were not future-live. [2024-10-11 19:03:32,161 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:03:32,290 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:03:32,291 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 19:03:32,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:32 BoogieIcfgContainer [2024-10-11 19:03:32,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:03:32,318 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:03:32,318 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:03:32,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:03:32,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:03:26" (1/3) ... [2024-10-11 19:03:32,323 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b59fdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:32, skipping insertion in model container [2024-10-11 19:03:32,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:03:27" (2/3) ... [2024-10-11 19:03:32,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b59fdea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:03:32, skipping insertion in model container [2024-10-11 19:03:32,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:03:32" (3/3) ... [2024-10-11 19:03:32,326 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test2-1.i [2024-10-11 19:03:32,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:03:32,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-10-11 19:03:32,419 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:03:32,425 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;@48e15458, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:03:32,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-10-11 19:03:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 19:03:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:03:32,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:32,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:03:32,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:32,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash 47005, now seen corresponding path program 1 times [2024-10-11 19:03:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752952048] [2024-10-11 19:03:32,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:32,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:03:32,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:32,453 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:32,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:32,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:03:32,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:32,661 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-11 19:03:32,676 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-11 19:03:32,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:32,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:32,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752952048] [2024-10-11 19:03:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752952048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:32,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:32,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:03:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657135398] [2024-10-11 19:03:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:32,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:03:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:32,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:03:32,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:03:32,728 INFO L87 Difference]: Start difference. First operand has 795 states, 360 states have (on average 2.477777777777778) internal successors, (892), 788 states have internal predecessors, (892), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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-11 19:03:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:34,052 INFO L93 Difference]: Finished difference Result 781 states and 838 transitions. [2024-10-11 19:03:34,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:03:34,056 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-11 19:03:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:34,082 INFO L225 Difference]: With dead ends: 781 [2024-10-11 19:03:34,083 INFO L226 Difference]: Without dead ends: 780 [2024-10-11 19:03:34,085 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-11 19:03:34,091 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 714 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:34,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 480 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:03:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-11 19:03:34,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 780. [2024-10-11 19:03:34,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 363 states have (on average 2.256198347107438) internal successors, (819), 773 states have internal predecessors, (819), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:34,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 837 transitions. [2024-10-11 19:03:34,184 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 837 transitions. Word has length 2 [2024-10-11 19:03:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:34,184 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 837 transitions. [2024-10-11 19:03:34,185 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-11 19:03:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 837 transitions. [2024-10-11 19:03:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-11 19:03:34,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:34,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-11 19:03:34,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 19:03:34,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:34,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:34,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:34,390 INFO L85 PathProgramCache]: Analyzing trace with hash 47006, now seen corresponding path program 1 times [2024-10-11 19:03:34,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:34,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967537569] [2024-10-11 19:03:34,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:34,391 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-11 19:03:34,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:34,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:34,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:34,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:03:34,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:34,506 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-11 19:03:34,519 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-11 19:03:34,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:34,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967537569] [2024-10-11 19:03:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967537569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:03:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659572020] [2024-10-11 19:03:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:34,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:03:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:03:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:03:34,523 INFO L87 Difference]: Start difference. First operand 780 states and 837 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-11 19:03:36,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:36,449 INFO L93 Difference]: Finished difference Result 984 states and 1073 transitions. [2024-10-11 19:03:36,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:03:36,449 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-11 19:03:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:36,454 INFO L225 Difference]: With dead ends: 984 [2024-10-11 19:03:36,454 INFO L226 Difference]: Without dead ends: 984 [2024-10-11 19:03:36,454 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-11 19:03:36,456 INFO L432 NwaCegarLoop]: 665 mSDtfsCounter, 225 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:36,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1066 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:03:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-10-11 19:03:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 896. [2024-10-11 19:03:36,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 475 states have (on average 2.1957894736842105) internal successors, (1043), 889 states have internal predecessors, (1043), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:03:36,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1071 transitions. [2024-10-11 19:03:36,487 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1071 transitions. Word has length 2 [2024-10-11 19:03:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:36,488 INFO L471 AbstractCegarLoop]: Abstraction has 896 states and 1071 transitions. [2024-10-11 19:03:36,488 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-11 19:03:36,488 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1071 transitions. [2024-10-11 19:03:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 19:03:36,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:36,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 19:03:36,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:03:36,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:36,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:36,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash 460900519, now seen corresponding path program 1 times [2024-10-11 19:03:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:36,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594362668] [2024-10-11 19:03:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:36,694 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-11 19:03:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:36,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:36,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:36,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:03:36,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:36,837 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-11 19:03:36,845 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-11 19:03:36,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:03:36,908 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-11 19:03:36,928 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:03:36,928 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-11 19:03:36,955 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-11 19:03:36,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:36,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:36,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594362668] [2024-10-11 19:03:36,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594362668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:36,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:36,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:03:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665499427] [2024-10-11 19:03:36,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:36,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:36,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:36,958 INFO L87 Difference]: Start difference. First operand 896 states and 1071 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-11 19:03:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:38,759 INFO L93 Difference]: Finished difference Result 885 states and 1059 transitions. [2024-10-11 19:03:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:03:38,761 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-11 19:03:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:38,764 INFO L225 Difference]: With dead ends: 885 [2024-10-11 19:03:38,764 INFO L226 Difference]: Without dead ends: 885 [2024-10-11 19:03:38,765 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-11 19:03:38,766 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 786 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:38,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 259 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:03:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-11 19:03:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 768. [2024-10-11 19:03:38,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 363 states have (on average 2.2203856749311295) internal successors, (806), 761 states have internal predecessors, (806), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:38,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 824 transitions. [2024-10-11 19:03:38,786 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 824 transitions. Word has length 6 [2024-10-11 19:03:38,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:38,786 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 824 transitions. [2024-10-11 19:03:38,787 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-11 19:03:38,787 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 824 transitions. [2024-10-11 19:03:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:03:38,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:38,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:03:38,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:38,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:38,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:38,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:38,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014203, now seen corresponding path program 1 times [2024-10-11 19:03:38,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:38,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193072764] [2024-10-11 19:03:38,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:38,993 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-11 19:03:38,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:38,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:38,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:39,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:03:39,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:39,113 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-11 19:03:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:03:39,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:39,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:39,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193072764] [2024-10-11 19:03:39,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193072764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:39,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:03:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278405595] [2024-10-11 19:03:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:39,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:03:39,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:39,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:03:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:03:39,148 INFO L87 Difference]: Start difference. First operand 768 states and 824 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-11 19:03:41,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:41,090 INFO L93 Difference]: Finished difference Result 1038 states and 1132 transitions. [2024-10-11 19:03:41,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:03:41,090 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-11 19:03:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:41,094 INFO L225 Difference]: With dead ends: 1038 [2024-10-11 19:03:41,095 INFO L226 Difference]: Without dead ends: 1038 [2024-10-11 19:03:41,095 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-11 19:03:41,096 INFO L432 NwaCegarLoop]: 756 mSDtfsCounter, 462 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:41,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1034 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 19:03:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-10-11 19:03:41,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 785. [2024-10-11 19:03:41,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 390 states have (on average 2.2153846153846155) internal successors, (864), 778 states have internal predecessors, (864), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:41,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 882 transitions. [2024-10-11 19:03:41,112 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 882 transitions. Word has length 7 [2024-10-11 19:03:41,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:41,112 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 882 transitions. [2024-10-11 19:03:41,112 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-11 19:03:41,113 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 882 transitions. [2024-10-11 19:03:41,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 19:03:41,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:41,113 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:03:41,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:41,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:41,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:41,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:41,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1403014202, now seen corresponding path program 1 times [2024-10-11 19:03:41,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:41,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069003615] [2024-10-11 19:03:41,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:41,315 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-11 19:03:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:41,319 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:41,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:41,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:03:41,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:41,432 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-11 19:03:41,444 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-11 19:03:41,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:41,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069003615] [2024-10-11 19:03:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069003615] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:03:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228354403] [2024-10-11 19:03:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:41,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:03:41,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:41,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:03:41,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:03:41,446 INFO L87 Difference]: Start difference. First operand 785 states and 882 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-11 19:03:42,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:42,782 INFO L93 Difference]: Finished difference Result 943 states and 1068 transitions. [2024-10-11 19:03:42,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:03:42,782 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-11 19:03:42,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:42,786 INFO L225 Difference]: With dead ends: 943 [2024-10-11 19:03:42,786 INFO L226 Difference]: Without dead ends: 943 [2024-10-11 19:03:42,787 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-11 19:03:42,788 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 681 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:42,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 724 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:03:42,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-10-11 19:03:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 738. [2024-10-11 19:03:42,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 390 states have (on average 2.0846153846153848) internal successors, (813), 731 states have internal predecessors, (813), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 831 transitions. [2024-10-11 19:03:42,810 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 831 transitions. Word has length 7 [2024-10-11 19:03:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:42,810 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 831 transitions. [2024-10-11 19:03:42,811 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-11 19:03:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 831 transitions. [2024-10-11 19:03:42,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 19:03:42,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:42,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:03:42,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-11 19:03:43,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:43,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr422ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:43,013 INFO L85 PathProgramCache]: Analyzing trace with hash 469131321, now seen corresponding path program 1 times [2024-10-11 19:03:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865841544] [2024-10-11 19:03:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:43,013 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-11 19:03:43,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:43,015 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:43,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:43,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:03:43,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:43,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:03:43,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:03:43,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:03:43,176 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-11 19:03:43,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:03:43,223 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-11 19:03:43,236 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-11 19:03:43,236 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:43,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:43,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865841544] [2024-10-11 19:03:43,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865841544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:43,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:43,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:03:43,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473514467] [2024-10-11 19:03:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:43,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:43,238 INFO L87 Difference]: Start difference. First operand 738 states and 831 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 19:03:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:44,398 INFO L93 Difference]: Finished difference Result 1459 states and 1647 transitions. [2024-10-11 19:03:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:03:44,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-10-11 19:03:44,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:44,406 INFO L225 Difference]: With dead ends: 1459 [2024-10-11 19:03:44,406 INFO L226 Difference]: Without dead ends: 1459 [2024-10-11 19:03:44,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-11 19:03:44,409 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 723 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:44,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 1947 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:03:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2024-10-11 19:03:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 740. [2024-10-11 19:03:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 392 states have (on average 2.079081632653061) internal successors, (815), 733 states have internal predecessors, (815), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 833 transitions. [2024-10-11 19:03:44,433 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 833 transitions. Word has length 9 [2024-10-11 19:03:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 833 transitions. [2024-10-11 19:03:44,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 19:03:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 833 transitions. [2024-10-11 19:03:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 19:03:44,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:44,434 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:03:44,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:44,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:44,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:44,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1384503377, now seen corresponding path program 1 times [2024-10-11 19:03:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626730626] [2024-10-11 19:03:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:44,636 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-11 19:03:44,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:44,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:44,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:44,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:03:44,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:44,795 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-11 19:03:44,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:44,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:44,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626730626] [2024-10-11 19:03:44,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626730626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:44,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:44,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:03:44,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998637241] [2024-10-11 19:03:44,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:44,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:03:44,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:03:44,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:03:44,798 INFO L87 Difference]: Start difference. First operand 740 states and 833 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-11 19:03:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:45,242 INFO L93 Difference]: Finished difference Result 701 states and 793 transitions. [2024-10-11 19:03:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:03:45,244 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-11 19:03:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:45,246 INFO L225 Difference]: With dead ends: 701 [2024-10-11 19:03:45,246 INFO L226 Difference]: Without dead ends: 701 [2024-10-11 19:03:45,246 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-11 19:03:45,247 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 61 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:45,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1206 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 19:03:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-10-11 19:03:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2024-10-11 19:03:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 377 states have (on average 2.055702917771883) internal successors, (775), 694 states have internal predecessors, (775), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 793 transitions. [2024-10-11 19:03:45,260 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 793 transitions. Word has length 15 [2024-10-11 19:03:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:45,260 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 793 transitions. [2024-10-11 19:03:45,260 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-11 19:03:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 793 transitions. [2024-10-11 19:03:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 19:03:45,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:45,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:03:45,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:45,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:45,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:45,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash -932119221, now seen corresponding path program 1 times [2024-10-11 19:03:45,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:45,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37273631] [2024-10-11 19:03:45,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:45,480 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-11 19:03:45,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:45,483 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:45,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:45,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:03:45,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:45,637 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-11 19:03:45,637 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:45,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37273631] [2024-10-11 19:03:45,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37273631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:45,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:03:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865355730] [2024-10-11 19:03:45,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:45,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:45,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:45,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:45,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:45,642 INFO L87 Difference]: Start difference. First operand 701 states and 793 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-11 19:03:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:46,213 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-11 19:03:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:03:46,216 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-11 19:03:46,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:46,219 INFO L225 Difference]: With dead ends: 686 [2024-10-11 19:03:46,219 INFO L226 Difference]: Without dead ends: 686 [2024-10-11 19:03:46,219 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-11 19:03:46,220 INFO L432 NwaCegarLoop]: 593 mSDtfsCounter, 45 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:46,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1761 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:03:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-11 19:03:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2024-10-11 19:03:46,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 376 states have (on average 2.002659574468085) internal successors, (753), 679 states have internal predecessors, (753), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:46,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 771 transitions. [2024-10-11 19:03:46,232 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 771 transitions. Word has length 17 [2024-10-11 19:03:46,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:46,233 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 771 transitions. [2024-10-11 19:03:46,233 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-11 19:03:46,233 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 771 transitions. [2024-10-11 19:03:46,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:03:46,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:46,234 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-11 19:03:46,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:03:46,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:46,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:46,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:46,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162457, now seen corresponding path program 1 times [2024-10-11 19:03:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590296772] [2024-10-11 19:03:46,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:46,436 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-11 19:03:46,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:46,437 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:46,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:46,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:03:46,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:46,585 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-11 19:03:46,654 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-11 19:03:46,654 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:46,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:46,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590296772] [2024-10-11 19:03:46,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590296772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:46,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:46,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:03:46,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128992634] [2024-10-11 19:03:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:46,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:46,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:46,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:46,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:46,655 INFO L87 Difference]: Start difference. First operand 686 states and 771 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-11 19:03:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:47,889 INFO L93 Difference]: Finished difference Result 686 states and 771 transitions. [2024-10-11 19:03:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:03:47,890 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-11 19:03:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:47,892 INFO L225 Difference]: With dead ends: 686 [2024-10-11 19:03:47,892 INFO L226 Difference]: Without dead ends: 686 [2024-10-11 19:03:47,892 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-11 19:03:47,892 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 623 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:47,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 613 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 19:03:47,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-11 19:03:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 682. [2024-10-11 19:03:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 376 states have (on average 1.9920212765957446) internal successors, (749), 675 states have internal predecessors, (749), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:47,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 767 transitions. [2024-10-11 19:03:47,903 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 767 transitions. Word has length 31 [2024-10-11 19:03:47,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:47,904 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 767 transitions. [2024-10-11 19:03:47,904 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-11 19:03:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 767 transitions. [2024-10-11 19:03:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 19:03:47,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:47,905 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-11 19:03:47,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:48,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:48,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:48,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1310162458, now seen corresponding path program 1 times [2024-10-11 19:03:48,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:48,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535001807] [2024-10-11 19:03:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:48,107 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-11 19:03:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:48,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:48,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:48,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:03:48,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:48,286 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-11 19:03:48,456 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-11 19:03:48,457 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:48,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535001807] [2024-10-11 19:03:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535001807] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:48,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:03:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856470521] [2024-10-11 19:03:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:48,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:48,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:48,458 INFO L87 Difference]: Start difference. First operand 682 states and 767 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-11 19:03:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:50,312 INFO L93 Difference]: Finished difference Result 935 states and 1017 transitions. [2024-10-11 19:03:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:03:50,313 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-11 19:03:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:50,316 INFO L225 Difference]: With dead ends: 935 [2024-10-11 19:03:50,316 INFO L226 Difference]: Without dead ends: 935 [2024-10-11 19:03:50,316 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-11 19:03:50,317 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 400 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:50,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1039 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 19:03:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2024-10-11 19:03:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 678. [2024-10-11 19:03:50,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 376 states have (on average 1.9813829787234043) internal successors, (745), 671 states have internal predecessors, (745), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 763 transitions. [2024-10-11 19:03:50,331 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 763 transitions. Word has length 31 [2024-10-11 19:03:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:50,332 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 763 transitions. [2024-10-11 19:03:50,332 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-11 19:03:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 763 transitions. [2024-10-11 19:03:50,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 19:03:50,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:50,333 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] [2024-10-11 19:03:50,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:50,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:50,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:50,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1916251283, now seen corresponding path program 1 times [2024-10-11 19:03:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058374725] [2024-10-11 19:03:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:50,539 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-11 19:03:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:50,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:50,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:50,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:03:50,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:50,782 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-11 19:03:50,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:50,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058374725] [2024-10-11 19:03:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058374725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:50,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:50,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:03:50,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905033178] [2024-10-11 19:03:50,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:50,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:50,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:50,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:50,785 INFO L87 Difference]: Start difference. First operand 678 states and 763 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 19:03:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:51,372 INFO L93 Difference]: Finished difference Result 672 states and 753 transitions. [2024-10-11 19:03:51,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:03:51,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2024-10-11 19:03:51,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:51,376 INFO L225 Difference]: With dead ends: 672 [2024-10-11 19:03:51,376 INFO L226 Difference]: Without dead ends: 672 [2024-10-11 19:03:51,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-11 19:03:51,377 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 15 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:51,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1744 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:03:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-10-11 19:03:51,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-10-11 19:03:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 370 states have (on average 1.9864864864864864) internal successors, (735), 665 states have internal predecessors, (735), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 19:03:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 753 transitions. [2024-10-11 19:03:51,390 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 753 transitions. Word has length 47 [2024-10-11 19:03:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:51,390 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 753 transitions. [2024-10-11 19:03:51,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 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-11 19:03:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 753 transitions. [2024-10-11 19:03:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 19:03:51,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:51,392 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] [2024-10-11 19:03:51,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:51,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:51,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:51,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:51,596 INFO L85 PathProgramCache]: Analyzing trace with hash 227917556, now seen corresponding path program 1 times [2024-10-11 19:03:51,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:51,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255568966] [2024-10-11 19:03:51,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:51,597 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-11 19:03:51,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:51,598 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:51,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:51,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:03:51,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:52,028 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-11 19:03:52,029 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:52,029 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255568966] [2024-10-11 19:03:52,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255568966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:52,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:03:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469798987] [2024-10-11 19:03:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:52,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:03:52,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:52,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:03:52,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:03:52,032 INFO L87 Difference]: Start difference. First operand 672 states and 753 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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-11 19:03:52,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:52,693 INFO L93 Difference]: Finished difference Result 853 states and 957 transitions. [2024-10-11 19:03:52,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:03:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2024-10-11 19:03:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:52,697 INFO L225 Difference]: With dead ends: 853 [2024-10-11 19:03:52,697 INFO L226 Difference]: Without dead ends: 853 [2024-10-11 19:03:52,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-11 19:03:52,698 INFO L432 NwaCegarLoop]: 712 mSDtfsCounter, 146 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:52,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1270 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 19:03:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-11 19:03:52,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 799. [2024-10-11 19:03:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 492 states have (on average 1.8821138211382114) internal successors, (926), 792 states have internal predecessors, (926), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:03:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 954 transitions. [2024-10-11 19:03:52,712 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 954 transitions. Word has length 51 [2024-10-11 19:03:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:52,713 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 954 transitions. [2024-10-11 19:03:52,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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-11 19:03:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 954 transitions. [2024-10-11 19:03:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 19:03:52,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:52,714 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-11 19:03:52,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:52,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:52,915 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:52,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:52,915 INFO L85 PathProgramCache]: Analyzing trace with hash -558822258, now seen corresponding path program 1 times [2024-10-11 19:03:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:52,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [639915905] [2024-10-11 19:03:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:52,916 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-11 19:03:52,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:52,917 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:52,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:53,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:03:53,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:53,217 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-11 19:03:53,228 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-11 19:03:53,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:03:53,672 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-11 19:03:53,688 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-11 19:03:53,688 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-11 19:03:53,702 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-11 19:03:53,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:53,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:53,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [639915905] [2024-10-11 19:03:53,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [639915905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:03:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579291875] [2024-10-11 19:03:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:53,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:53,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:53,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:53,724 INFO L87 Difference]: Start difference. First operand 799 states and 954 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-11 19:03:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:54,827 INFO L93 Difference]: Finished difference Result 761 states and 916 transitions. [2024-10-11 19:03:54,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:03:54,828 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-11 19:03:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:54,830 INFO L225 Difference]: With dead ends: 761 [2024-10-11 19:03:54,830 INFO L226 Difference]: Without dead ends: 761 [2024-10-11 19:03:54,830 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-11 19:03:54,831 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1114 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:54,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 203 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:03:54,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2024-10-11 19:03:54,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 734. [2024-10-11 19:03:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:03:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 852 transitions. [2024-10-11 19:03:54,843 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 852 transitions. Word has length 54 [2024-10-11 19:03:54,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:54,844 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 852 transitions. [2024-10-11 19:03:54,844 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-11 19:03:54,844 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 852 transitions. [2024-10-11 19:03:54,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:03:54,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:54,845 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-11 19:03:54,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:55,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:55,046 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:55,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash 277799603, now seen corresponding path program 1 times [2024-10-11 19:03:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:55,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36678985] [2024-10-11 19:03:55,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:55,048 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-11 19:03:55,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:55,051 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:55,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:55,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:03:55,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:55,295 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-11 19:03:55,313 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-11 19:03:55,335 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-11 19:03:55,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:03:55,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:55,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36678985] [2024-10-11 19:03:55,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36678985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:55,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:55,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:03:55,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593998266] [2024-10-11 19:03:55,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:55,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:03:55,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:55,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:03:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:03:55,348 INFO L87 Difference]: Start difference. First operand 734 states and 852 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-11 19:03:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:56,659 INFO L93 Difference]: Finished difference Result 733 states and 851 transitions. [2024-10-11 19:03:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:03:56,659 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-11 19:03:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:56,662 INFO L225 Difference]: With dead ends: 733 [2024-10-11 19:03:56,662 INFO L226 Difference]: Without dead ends: 733 [2024-10-11 19:03:56,662 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-11 19:03:56,663 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 2 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:56,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1506 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 19:03:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-11 19:03:56,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2024-10-11 19:03:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 465 states have (on average 1.7698924731182795) internal successors, (823), 726 states have internal predecessors, (823), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:03:56,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 851 transitions. [2024-10-11 19:03:56,676 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 851 transitions. Word has length 58 [2024-10-11 19:03:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:56,676 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 851 transitions. [2024-10-11 19:03:56,676 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-11 19:03:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 851 transitions. [2024-10-11 19:03:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 19:03:56,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:56,677 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-11 19:03:56,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 19:03:56,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:56,878 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:56,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:56,879 INFO L85 PathProgramCache]: Analyzing trace with hash 277799604, now seen corresponding path program 1 times [2024-10-11 19:03:56,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:56,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222719673] [2024-10-11 19:03:56,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:56,880 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-11 19:03:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:56,883 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:56,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:57,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:57,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 19:03:57,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:57,144 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-11 19:03:57,164 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-11 19:03:57,172 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-11 19:03:57,210 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-11 19:03:57,229 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-11 19:03:57,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:57,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:57,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222719673] [2024-10-11 19:03:57,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222719673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:57,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:57,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:03:57,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317448289] [2024-10-11 19:03:57,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:57,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:03:57,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:57,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:03:57,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:03:57,232 INFO L87 Difference]: Start difference. First operand 733 states and 851 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-11 19:03:58,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:03:58,936 INFO L93 Difference]: Finished difference Result 732 states and 850 transitions. [2024-10-11 19:03:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:03:58,937 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-11 19:03:58,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:03:58,939 INFO L225 Difference]: With dead ends: 732 [2024-10-11 19:03:58,940 INFO L226 Difference]: Without dead ends: 732 [2024-10-11 19:03:58,940 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-11 19:03:58,940 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 1 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 19:03:58,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1523 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 19:03:58,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-11 19:03:58,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 732. [2024-10-11 19:03:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 464 states have (on average 1.771551724137931) internal successors, (822), 725 states have internal predecessors, (822), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 19:03:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 850 transitions. [2024-10-11 19:03:58,951 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 850 transitions. Word has length 58 [2024-10-11 19:03:58,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:03:58,952 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 850 transitions. [2024-10-11 19:03:58,952 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-11 19:03:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 850 transitions. [2024-10-11 19:03:58,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 19:03:58,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:03:58,953 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-11 19:03:58,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:59,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:59,154 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:03:59,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:03:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2031959543, now seen corresponding path program 1 times [2024-10-11 19:03:59,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:03:59,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549344690] [2024-10-11 19:03:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:03:59,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 19:03:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:03:59,158 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:59,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:03:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:03:59,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:03:59,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:03:59,467 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-11 19:03:59,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:03:59,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:03:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549344690] [2024-10-11 19:03:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549344690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:03:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:03:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:03:59,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731395896] [2024-10-11 19:03:59,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:03:59,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:03:59,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:03:59,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:03:59,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:03:59,469 INFO L87 Difference]: Start difference. First operand 732 states and 850 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-11 19:04:00,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:04:00,023 INFO L93 Difference]: Finished difference Result 734 states and 853 transitions. [2024-10-11 19:04:00,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:04:00,025 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-11 19:04:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:04:00,028 INFO L225 Difference]: With dead ends: 734 [2024-10-11 19:04:00,028 INFO L226 Difference]: Without dead ends: 734 [2024-10-11 19:04:00,028 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-11 19:04:00,029 INFO L432 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 19:04:00,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1680 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 19:04:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-11 19:04:00,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2024-10-11 19:04:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 465 states have (on average 1.772043010752688) internal successors, (824), 727 states have internal predecessors, (824), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:04:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 853 transitions. [2024-10-11 19:04:00,043 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 853 transitions. Word has length 64 [2024-10-11 19:04:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:04:00,044 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 853 transitions. [2024-10-11 19:04:00,044 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-11 19:04:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 853 transitions. [2024-10-11 19:04:00,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 19:04:00,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:04:00,045 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-11 19:04:00,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-11 19:04:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:00,246 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:04:00,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:04:00,247 INFO L85 PathProgramCache]: Analyzing trace with hash 282811127, now seen corresponding path program 1 times [2024-10-11 19:04:00,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:04:00,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990772312] [2024-10-11 19:04:00,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:04:00,247 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-11 19:04:00,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:04:00,250 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:00,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:04:00,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:04:00,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:04:00,525 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-11 19:04:00,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:04:00,581 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-11 19:04:00,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:04:00,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990772312] [2024-10-11 19:04:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990772312] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:04:00,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:04:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 19:04:00,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332293330] [2024-10-11 19:04:00,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:04:00,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 19:04:00,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:04:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 19:04:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 19:04:00,583 INFO L87 Difference]: Start difference. First operand 734 states and 853 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-11 19:04:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:04:01,511 INFO L93 Difference]: Finished difference Result 743 states and 867 transitions. [2024-10-11 19:04:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:04:01,514 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-11 19:04:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:04:01,518 INFO L225 Difference]: With dead ends: 743 [2024-10-11 19:04:01,519 INFO L226 Difference]: Without dead ends: 743 [2024-10-11 19:04:01,519 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-11 19:04:01,519 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 4 mSDsluCounter, 2790 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3350 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 19:04:01,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3350 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 19:04:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-10-11 19:04:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 742. [2024-10-11 19:04:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 472 states have (on average 1.7733050847457628) internal successors, (837), 734 states have internal predecessors, (837), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:04:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 866 transitions. [2024-10-11 19:04:01,533 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 866 transitions. Word has length 65 [2024-10-11 19:04:01,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:04:01,534 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 866 transitions. [2024-10-11 19:04:01,534 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-11 19:04:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 866 transitions. [2024-10-11 19:04:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 19:04:01,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:04:01,536 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-11 19:04:01,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-11 19:04:01,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:01,737 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:04:01,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:04:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2042855945, now seen corresponding path program 2 times [2024-10-11 19:04:01,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:04:01,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977835405] [2024-10-11 19:04:01,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:04:01,738 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-11 19:04:01,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:04:01,742 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:01,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:02,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 19:04:02,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:04:02,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 19:04:02,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:04:02,268 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-11 19:04:02,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:04:02,393 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-11 19:04:02,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:04:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977835405] [2024-10-11 19:04:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977835405] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:04:02,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:04:02,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 19:04:02,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647726292] [2024-10-11 19:04:02,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:04:02,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 19:04:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:04:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 19:04:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 19:04:02,396 INFO L87 Difference]: Start difference. First operand 742 states and 866 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-11 19:04:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:04:03,692 INFO L93 Difference]: Finished difference Result 754 states and 885 transitions. [2024-10-11 19:04:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 19:04:03,694 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-11 19:04:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:04:03,697 INFO L225 Difference]: With dead ends: 754 [2024-10-11 19:04:03,697 INFO L226 Difference]: Without dead ends: 752 [2024-10-11 19:04:03,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-11 19:04:03,697 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 7 mSDsluCounter, 3352 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3912 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 19:04:03,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3912 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 19:04:03,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2024-10-11 19:04:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 751. [2024-10-11 19:04:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 481 states have (on average 1.7650727650727651) internal successors, (849), 743 states have internal predecessors, (849), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:04:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 878 transitions. [2024-10-11 19:04:03,712 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 878 transitions. Word has length 68 [2024-10-11 19:04:03,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:04:03,712 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 878 transitions. [2024-10-11 19:04:03,712 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-11 19:04:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 878 transitions. [2024-10-11 19:04:03,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-11 19:04:03,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:04:03,713 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-11 19:04:03,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:03,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:03,914 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:04:03,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:04:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1142989321, now seen corresponding path program 3 times [2024-10-11 19:04:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:04:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864274940] [2024-10-11 19:04:03,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:04:03,916 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-11 19:04:03,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:04:03,919 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:03,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:04,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 19:04:04,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:04:04,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 19:04:04,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:04:04,734 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-11 19:04:04,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:04:05,234 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-11 19:04:05,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:04:05,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864274940] [2024-10-11 19:04:05,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864274940] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:04:05,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:04:05,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 19:04:05,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783380778] [2024-10-11 19:04:05,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:04:05,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 19:04:05,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:04:05,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 19:04:05,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 19:04:05,237 INFO L87 Difference]: Start difference. First operand 751 states and 878 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-11 19:04:08,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:04:08,520 INFO L93 Difference]: Finished difference Result 772 states and 914 transitions. [2024-10-11 19:04:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 19:04:08,521 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-11 19:04:08,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:04:08,523 INFO L225 Difference]: With dead ends: 772 [2024-10-11 19:04:08,524 INFO L226 Difference]: Without dead ends: 769 [2024-10-11 19:04:08,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 19:04:08,525 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 14 mSDsluCounter, 6705 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 7265 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 19:04:08,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 7265 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 19:04:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-10-11 19:04:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 769. [2024-10-11 19:04:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 499 states have (on average 1.74749498997996) internal successors, (872), 761 states have internal predecessors, (872), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:04:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 901 transitions. [2024-10-11 19:04:08,537 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 901 transitions. Word has length 74 [2024-10-11 19:04:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:04:08,537 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 901 transitions. [2024-10-11 19:04:08,537 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-11 19:04:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 901 transitions. [2024-10-11 19:04:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 19:04:08,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:04:08,539 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-11 19:04:08,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2024-10-11 19:04:08,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:08,740 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:04:08,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:04:08,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1674764809, now seen corresponding path program 4 times [2024-10-11 19:04:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:04:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068762907] [2024-10-11 19:04:08,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 19:04:08,741 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-11 19:04:08,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:04:08,744 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:08,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:09,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 19:04:09,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:04:09,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 19:04:09,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:04:09,605 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-11 19:04:09,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:04:10,867 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-11 19:04:10,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:04:10,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068762907] [2024-10-11 19:04:10,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068762907] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 19:04:10,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 19:04:10,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 19:04:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271904353] [2024-10-11 19:04:10,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 19:04:10,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 19:04:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:04:10,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 19:04:10,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 19:04:10,871 INFO L87 Difference]: Start difference. First operand 769 states and 901 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-11 19:04:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 19:04:18,657 INFO L93 Difference]: Finished difference Result 806 states and 970 transitions. [2024-10-11 19:04:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 19:04:18,659 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-11 19:04:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 19:04:18,661 INFO L225 Difference]: With dead ends: 806 [2024-10-11 19:04:18,661 INFO L226 Difference]: Without dead ends: 804 [2024-10-11 19:04:18,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 19:04:18,664 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 25 mSDsluCounter, 13415 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 13975 SdHoareTripleChecker+Invalid, 3773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 19:04:18,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 13975 Invalid, 3773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 19:04:18,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-10-11 19:04:18,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 803. [2024-10-11 19:04:18,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 533 states have (on average 1.722326454033771) internal successors, (918), 795 states have internal predecessors, (918), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 19:04:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 947 transitions. [2024-10-11 19:04:18,675 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 947 transitions. Word has length 86 [2024-10-11 19:04:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 19:04:18,675 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 947 transitions. [2024-10-11 19:04:18,675 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-11 19:04:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 947 transitions. [2024-10-11 19:04:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 19:04:18,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 19:04:18,676 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-11 19:04:18,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-11 19:04:18,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:18,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-10-11 19:04:18,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:04:18,877 INFO L85 PathProgramCache]: Analyzing trace with hash -535495177, now seen corresponding path program 5 times [2024-10-11 19:04:18,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:04:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794960504] [2024-10-11 19:04:18,878 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:04:18,878 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-11 19:04:18,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:04:18,879 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:18,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:04:20,058 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-11 19:04:20,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:04:20,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-11 19:04:20,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:04:20,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:04:20,194 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-11 19:04:20,195 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-11 19:04:20,219 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-11 19:04:20,279 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-11 19:04:21,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-11 19:04:21,284 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-11 19:04:21,332 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-11 19:04:21,364 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-11 19:04:21,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 19:04:21,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:04:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794960504] [2024-10-11 19:04:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794960504] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 19:04:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2121097866] [2024-10-11 19:04:21,704 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 19:04:21,704 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 19:04:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 19:04:21,705 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 19:04:21,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process