./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:55:11,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:55:11,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:55:11,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:55:11,117 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:55:11,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:55:11,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:55:11,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:55:11,145 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:55:11,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:55:11,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:55:11,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:55:11,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:55:11,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:55:11,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:55:11,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:55:11,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:55:11,152 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:55:11,152 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:55:11,152 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:55:11,152 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:55:11,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:55:11,155 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:55:11,155 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:55:11,155 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:55:11,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:55:11,155 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:55:11,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:55:11,156 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:55:11,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:55:11,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:55:11,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:55:11,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:55:11,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:55:11,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:55:11,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:55:11,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:55:11,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:55:11,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:55:11,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:55:11,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:55:11,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:55:11,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:55:11,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:55:11,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:55:11,161 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-11-12 12:55:11,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:55:11,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:55:11,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:55:11,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:55:11,452 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:55:11,454 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-12 12:55:12,955 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:55:13,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:55:13,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-12 12:55:13,269 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81093a51/04e59e116e594e419d70694358334307/FLAG5c17460b7 [2024-11-12 12:55:13,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81093a51/04e59e116e594e419d70694358334307 [2024-11-12 12:55:13,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:55:13,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:55:13,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:55:13,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:55:13,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:55:13,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:55:13" (1/1) ... [2024-11-12 12:55:13,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505d8372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:13, skipping insertion in model container [2024-11-12 12:55:13,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:55:13" (1/1) ... [2024-11-12 12:55:13,634 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:55:14,063 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,172 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,178 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,193 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,230 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,234 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,236 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,242 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,244 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,245 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,250 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,251 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,254 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,256 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,257 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,257 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,260 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:14,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:55:14,290 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-11-12 12:55:14,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6d5fe1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:14, skipping insertion in model container [2024-11-12 12:55:14,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:55:14,292 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 12:55:14,294 INFO L158 Benchmark]: Toolchain (without parser) took 759.02ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 49.1MB in the beginning and 101.1MB in the end (delta: -52.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-12 12:55:14,295 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:55:14,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.46ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 48.8MB in the beginning and 101.1MB in the end (delta: -52.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2024-11-12 12:55:14,297 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.26ms. Allocated memory is still 123.7MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.46ms. Allocated memory was 123.7MB in the beginning and 153.1MB in the end (delta: 29.4MB). Free memory was 48.8MB in the beginning and 101.1MB in the end (delta: -52.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 760]: 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:55:16,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:55:16,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-12 12:55:16,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:55:16,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:55:16,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:55:16,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:55:16,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:55:16,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:55:16,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:55:16,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:55:16,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:55:16,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:55:16,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:55:16,497 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:55:16,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:55:16,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:55:16,498 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:55:16,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:55:16,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:55:16,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:55:16,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:55:16,503 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:55:16,503 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:55:16,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:55:16,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:55:16,504 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:55:16,504 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 12:55:16,505 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:55:16,505 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 12:55:16,505 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:55:16,505 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:55:16,506 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:55:16,506 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:55:16,506 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:55:16,506 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:55:16,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:55:16,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:55:16,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:55:16,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:55:16,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:55:16,508 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 12:55:16,509 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 12:55:16,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:55:16,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:55:16,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:55:16,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:55:16,510 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> a37ff9cc75e7eb9f5325f8fa274b6f05ade1742d661d8f4c826631afb9b4bde2 [2024-11-12 12:55:16,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:55:16,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:55:16,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:55:16,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:55:16,861 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:55:16,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-12 12:55:18,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:55:18,794 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:55:18,795 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test5-3.i [2024-11-12 12:55:18,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4817ca1af/4c99219643584670b4ed7d878b374ea8/FLAGe95ddd3ca [2024-11-12 12:55:18,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4817ca1af/4c99219643584670b4ed7d878b374ea8 [2024-11-12 12:55:18,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:55:18,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:55:18,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:55:18,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:55:18,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:55:18,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:55:18" (1/1) ... [2024-11-12 12:55:18,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542927d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:18, skipping insertion in model container [2024-11-12 12:55:18,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:55:18" (1/1) ... [2024-11-12 12:55:18,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:55:19,340 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,369 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,373 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,376 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,382 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,408 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,410 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,413 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,420 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,450 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,450 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,459 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,466 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,468 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,472 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,474 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,479 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,480 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,480 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,483 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:55:19,509 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 12:55:19,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:55:19,551 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,569 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,574 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,581 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,621 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,623 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,627 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,633 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,658 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,661 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,668 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,670 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,674 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,675 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,675 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,678 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,678 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,679 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,679 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,681 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:55:19,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:55:19,689 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:55:19,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:55:19,829 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:55:19,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19 WrapperNode [2024-11-12 12:55:19,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:55:19,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:55:19,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:55:19,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:55:19,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:19,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:19,986 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1728 [2024-11-12 12:55:19,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:55:19,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:55:19,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:55:19,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:55:19,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:19,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,194 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [2, 24, 417]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 99 writes are split as follows [0, 1, 98]. [2024-11-12 12:55:20,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:55:20,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:55:20,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:55:20,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:55:20,304 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (1/1) ... [2024-11-12 12:55:20,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:55:20,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:55:20,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:55:20,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:55:20,388 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 12:55:20,388 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 12:55:20,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 12:55:20,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 12:55:20,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 12:55:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 12:55:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 12:55:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 12:55:20,390 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 12:55:20,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 12:55:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 12:55:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 12:55:20,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 12:55:20,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 12:55:20,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 12:55:20,392 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 12:55:20,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:55:20,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:55:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:55:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:55:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 12:55:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:55:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:55:20,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 12:55:20,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:55:20,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:55:20,715 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:55:20,717 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:55:35,141 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2024-11-12 12:55:35,142 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:55:35,167 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:55:35,170 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-12 12:55:35,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:55:35 BoogieIcfgContainer [2024-11-12 12:55:35,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:55:35,173 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:55:35,173 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:55:35,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:55:35,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:55:18" (1/3) ... [2024-11-12 12:55:35,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3660603b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:55:35, skipping insertion in model container [2024-11-12 12:55:35,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:55:19" (2/3) ... [2024-11-12 12:55:35,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3660603b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:55:35, skipping insertion in model container [2024-11-12 12:55:35,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:55:35" (3/3) ... [2024-11-12 12:55:35,179 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test5-3.i [2024-11-12 12:55:35,194 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:55:35,194 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:55:35,236 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:55:35,241 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;@1c8f0975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:55:35,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:55:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 313 states have internal predecessors, (508), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 12:55:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 12:55:35,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:35,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:55:35,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:35,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:35,262 INFO L85 PathProgramCache]: Analyzing trace with hash 334886841, now seen corresponding path program 1 times [2024-11-12 12:55:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:35,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020682306] [2024-11-12 12:55:35,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:35,275 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-11-12 12:55:35,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:35,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:35,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 12:55:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:35,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 12:55:35,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:55:35,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:35,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020682306] [2024-11-12 12:55:35,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020682306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:35,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:55:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169110866] [2024-11-12 12:55:35,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:35,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 12:55:35,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:35,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 12:55:35,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:55:35,577 INFO L87 Difference]: Start difference. First operand has 323 states, 304 states have (on average 1.6710526315789473) internal successors, (508), 313 states have internal predecessors, (508), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:55:35,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:35,643 INFO L93 Difference]: Finished difference Result 321 states and 422 transitions. [2024-11-12 12:55:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 12:55:35,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-12 12:55:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:35,671 INFO L225 Difference]: With dead ends: 321 [2024-11-12 12:55:35,671 INFO L226 Difference]: Without dead ends: 319 [2024-11-12 12:55:35,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 12:55:35,680 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:35,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 12:55:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-12 12:55:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-12 12:55:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 302 states have (on average 1.3112582781456954) internal successors, (396), 309 states have internal predecessors, (396), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 12:55:35,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 420 transitions. [2024-11-12 12:55:35,794 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 420 transitions. Word has length 10 [2024-11-12 12:55:35,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:35,794 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 420 transitions. [2024-11-12 12:55:35,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:55:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 420 transitions. [2024-11-12 12:55:35,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 12:55:35,795 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:35,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:55:35,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 12:55:35,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:35,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:35,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:35,999 INFO L85 PathProgramCache]: Analyzing trace with hash 909565367, now seen corresponding path program 1 times [2024-11-12 12:55:35,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:35,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638846504] [2024-11-12 12:55:35,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:36,000 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-11-12 12:55:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:36,002 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:36,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 12:55:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:36,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 12:55:36,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:55:36,215 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:36,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638846504] [2024-11-12 12:55:36,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638846504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:36,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:36,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:55:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225914607] [2024-11-12 12:55:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:36,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:55:36,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:55:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:55:36,218 INFO L87 Difference]: Start difference. First operand 319 states and 420 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-12 12:55:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:36,460 INFO L93 Difference]: Finished difference Result 566 states and 749 transitions. [2024-11-12 12:55:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:55:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-12 12:55:36,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:36,469 INFO L225 Difference]: With dead ends: 566 [2024-11-12 12:55:36,469 INFO L226 Difference]: Without dead ends: 566 [2024-11-12 12:55:36,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-11-12 12:55:36,472 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 304 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:36,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 860 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:55:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-12 12:55:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 321. [2024-11-12 12:55:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 304 states have (on average 1.3092105263157894) internal successors, (398), 311 states have internal predecessors, (398), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 12:55:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 422 transitions. [2024-11-12 12:55:36,496 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 422 transitions. Word has length 11 [2024-11-12 12:55:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:36,497 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 422 transitions. [2024-11-12 12:55:36,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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-11-12 12:55:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 422 transitions. [2024-11-12 12:55:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 12:55:36,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:36,503 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:36,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 12:55:36,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:36,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:36,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1663298653, now seen corresponding path program 1 times [2024-11-12 12:55:36,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:36,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776725496] [2024-11-12 12:55:36,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:36,709 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-11-12 12:55:36,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:36,710 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:36,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 12:55:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:37,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:55:37,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:37,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:55:37,461 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:37,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776725496] [2024-11-12 12:55:37,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776725496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:37,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:37,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:55:37,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914242707] [2024-11-12 12:55:37,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:37,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:55:37,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:37,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:55:37,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:55:37,468 INFO L87 Difference]: Start difference. First operand 321 states and 422 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:55:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:37,588 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2024-11-12 12:55:37,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:55:37,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-12 12:55:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:37,591 INFO L225 Difference]: With dead ends: 324 [2024-11-12 12:55:37,591 INFO L226 Difference]: Without dead ends: 324 [2024-11-12 12:55:37,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 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-11-12 12:55:37,593 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 30 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:37,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1151 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-12 12:55:37,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-12 12:55:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 307 states have (on average 1.280130293159609) internal successors, (393), 314 states have internal predecessors, (393), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 12:55:37,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2024-11-12 12:55:37,612 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 152 [2024-11-12 12:55:37,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:37,613 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2024-11-12 12:55:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:55:37,613 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2024-11-12 12:55:37,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-12 12:55:37,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:37,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:37,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 12:55:37,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:37,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:37,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:37,820 INFO L85 PathProgramCache]: Analyzing trace with hash -287494633, now seen corresponding path program 1 times [2024-11-12 12:55:37,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:37,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705150937] [2024-11-12 12:55:37,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:37,822 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-11-12 12:55:37,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:37,823 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:37,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 12:55:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:38,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:55:38,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:55:38,728 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:38,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:38,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705150937] [2024-11-12 12:55:38,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705150937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:38,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:38,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:55:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648644486] [2024-11-12 12:55:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:38,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:55:38,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:38,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:55:38,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:55:38,731 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:55:39,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:39,294 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2024-11-12 12:55:39,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:55:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-12 12:55:39,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:39,299 INFO L225 Difference]: With dead ends: 420 [2024-11-12 12:55:39,299 INFO L226 Difference]: Without dead ends: 420 [2024-11-12 12:55:39,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-11-12 12:55:39,300 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 73 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:39,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 820 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 12:55:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-12 12:55:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 366. [2024-11-12 12:55:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 349 states have (on average 1.2578796561604584) internal successors, (439), 356 states have internal predecessors, (439), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-12 12:55:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 463 transitions. [2024-11-12 12:55:39,310 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 463 transitions. Word has length 152 [2024-11-12 12:55:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:39,311 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 463 transitions. [2024-11-12 12:55:39,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:55:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 463 transitions. [2024-11-12 12:55:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 12:55:39,318 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:39,318 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:39,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-12 12:55:39,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:39,523 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:39,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1009970195, now seen corresponding path program 1 times [2024-11-12 12:55:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458969416] [2024-11-12 12:55:39,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:39,525 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-11-12 12:55:39,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:39,529 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:39,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 12:55:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:40,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:55:40,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:55:40,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:40,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:40,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458969416] [2024-11-12 12:55:40,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458969416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:40,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:40,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:55:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711538710] [2024-11-12 12:55:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:55:40,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:40,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:55:40,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:55:40,233 INFO L87 Difference]: Start difference. First operand 366 states and 463 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 12:55:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:40,305 INFO L93 Difference]: Finished difference Result 369 states and 468 transitions. [2024-11-12 12:55:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:55:40,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 167 [2024-11-12 12:55:40,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:40,309 INFO L225 Difference]: With dead ends: 369 [2024-11-12 12:55:40,309 INFO L226 Difference]: Without dead ends: 369 [2024-11-12 12:55:40,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 164 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-11-12 12:55:40,312 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:40,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1208 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:40,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-12 12:55:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-12 12:55:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 351 states have (on average 1.2592592592592593) internal successors, (442), 359 states have internal predecessors, (442), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:55:40,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 468 transitions. [2024-11-12 12:55:40,332 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 468 transitions. Word has length 167 [2024-11-12 12:55:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:40,332 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 468 transitions. [2024-11-12 12:55:40,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 12:55:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 468 transitions. [2024-11-12 12:55:40,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 12:55:40,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:40,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:40,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 12:55:40,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:40,543 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:40,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:40,544 INFO L85 PathProgramCache]: Analyzing trace with hash 783724203, now seen corresponding path program 1 times [2024-11-12 12:55:40,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:40,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1590721398] [2024-11-12 12:55:40,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:40,545 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-11-12 12:55:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:40,546 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:40,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 12:55:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:41,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:55:41,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:55:41,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:55:41,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:41,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1590721398] [2024-11-12 12:55:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1590721398] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:41,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 12:55:41,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95820469] [2024-11-12 12:55:41,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:41,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:55:41,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:41,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:55:41,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:55:41,338 INFO L87 Difference]: Start difference. First operand 369 states and 468 transitions. Second operand has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:41,623 INFO L93 Difference]: Finished difference Result 380 states and 485 transitions. [2024-11-12 12:55:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:55:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 169 [2024-11-12 12:55:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:41,627 INFO L225 Difference]: With dead ends: 380 [2024-11-12 12:55:41,627 INFO L226 Difference]: Without dead ends: 380 [2024-11-12 12:55:41,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 330 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-11-12 12:55:41,628 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 5 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:41,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2002 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:55:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-12 12:55:41,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2024-11-12 12:55:41,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 359 states have (on average 1.2701949860724233) internal successors, (456), 367 states have internal predecessors, (456), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:55:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 482 transitions. [2024-11-12 12:55:41,639 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 482 transitions. Word has length 169 [2024-11-12 12:55:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:41,640 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 482 transitions. [2024-11-12 12:55:41,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.5) internal successors, (172), 8 states have internal predecessors, (172), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 482 transitions. [2024-11-12 12:55:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 12:55:41,642 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:41,643 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:41,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-12 12:55:41,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:41,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:41,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:41,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1507762931, now seen corresponding path program 2 times [2024-11-12 12:55:41,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:41,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829212934] [2024-11-12 12:55:41,845 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:55:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:41,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:41,847 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:41,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 12:55:42,257 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 12:55:42,257 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:42,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:55:42,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:42,307 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-12 12:55:42,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:42,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:42,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829212934] [2024-11-12 12:55:42,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829212934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:42,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:42,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:55:42,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747355861] [2024-11-12 12:55:42,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:42,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:55:42,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:42,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:55:42,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:55:42,312 INFO L87 Difference]: Start difference. First operand 378 states and 482 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:55:42,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:42,456 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2024-11-12 12:55:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:55:42,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 173 [2024-11-12 12:55:42,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:42,459 INFO L225 Difference]: With dead ends: 381 [2024-11-12 12:55:42,459 INFO L226 Difference]: Without dead ends: 381 [2024-11-12 12:55:42,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 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-11-12 12:55:42,460 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 33 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:42,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1115 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-12 12:55:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-12 12:55:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 362 states have (on average 1.2458563535911602) internal successors, (451), 370 states have internal predecessors, (451), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:55:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 477 transitions. [2024-11-12 12:55:42,471 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 477 transitions. Word has length 173 [2024-11-12 12:55:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:42,473 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 477 transitions. [2024-11-12 12:55:42,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:55:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 477 transitions. [2024-11-12 12:55:42,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 12:55:42,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:42,476 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:42,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-12 12:55:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:42,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:42,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:42,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1144553403, now seen corresponding path program 1 times [2024-11-12 12:55:42,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:42,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609180555] [2024-11-12 12:55:42,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:42,679 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-11-12 12:55:42,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:42,680 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:42,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 12:55:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:43,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 12:55:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:55:43,534 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:43,912 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:55:43,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609180555] [2024-11-12 12:55:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609180555] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:43,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:43,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 12:55:43,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937666539] [2024-11-12 12:55:43,913 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 12:55:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 12:55:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 12:55:43,915 INFO L87 Difference]: Start difference. First operand 381 states and 477 transitions. Second operand has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:44,696 INFO L93 Difference]: Finished difference Result 396 states and 500 transitions. [2024-11-12 12:55:44,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:55:44,697 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 173 [2024-11-12 12:55:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:44,699 INFO L225 Difference]: With dead ends: 396 [2024-11-12 12:55:44,700 INFO L226 Difference]: Without dead ends: 392 [2024-11-12 12:55:44,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 12:55:44,702 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 8 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:44,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2733 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 12:55:44,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-12 12:55:44,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-12 12:55:44,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 371 states have (on average 1.247978436657682) internal successors, (463), 379 states have internal predecessors, (463), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:55:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 489 transitions. [2024-11-12 12:55:44,717 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 489 transitions. Word has length 173 [2024-11-12 12:55:44,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:44,718 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 489 transitions. [2024-11-12 12:55:44,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.714285714285714) internal successors, (178), 14 states have internal predecessors, (178), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 489 transitions. [2024-11-12 12:55:44,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-12 12:55:44,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:44,722 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:44,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-12 12:55:44,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:44,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:44,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1188344146, now seen corresponding path program 2 times [2024-11-12 12:55:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037462614] [2024-11-12 12:55:44,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:55:44,925 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-11-12 12:55:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:44,926 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:44,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 12:55:45,318 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 12:55:45,318 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:45,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:55:45,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-12 12:55:45,432 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:55:45,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:45,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037462614] [2024-11-12 12:55:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037462614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:55:45,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:55:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:55:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014066571] [2024-11-12 12:55:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:55:45,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:55:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:45,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:55:45,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:55:45,435 INFO L87 Difference]: Start difference. First operand 390 states and 489 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:55:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:45,541 INFO L93 Difference]: Finished difference Result 384 states and 479 transitions. [2024-11-12 12:55:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:55:45,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 182 [2024-11-12 12:55:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:45,544 INFO L225 Difference]: With dead ends: 384 [2024-11-12 12:55:45,544 INFO L226 Difference]: Without dead ends: 384 [2024-11-12 12:55:45,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:55:45,545 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 8 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:45,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1115 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:55:45,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-12 12:55:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-12 12:55:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 365 states have (on average 1.2410958904109588) internal successors, (453), 373 states have internal predecessors, (453), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:55:45,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 479 transitions. [2024-11-12 12:55:45,560 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 479 transitions. Word has length 182 [2024-11-12 12:55:45,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:45,561 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 479 transitions. [2024-11-12 12:55:45,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:55:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 479 transitions. [2024-11-12 12:55:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-12 12:55:45,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:45,563 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:45,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 12:55:45,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:45,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:45,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:45,765 INFO L85 PathProgramCache]: Analyzing trace with hash 726238360, now seen corresponding path program 1 times [2024-11-12 12:55:45,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:45,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359381568] [2024-11-12 12:55:45,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:55:45,766 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-11-12 12:55:45,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:45,769 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:45,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 12:55:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:55:46,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 12:55:46,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 12:55:46,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 1 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 12:55:47,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359381568] [2024-11-12 12:55:47,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359381568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:47,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:47,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 12:55:47,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865892758] [2024-11-12 12:55:47,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:47,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 12:55:47,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:47,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 12:55:47,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 12:55:47,162 INFO L87 Difference]: Start difference. First operand 384 states and 479 transitions. Second operand has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:55:49,120 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2024-11-12 12:55:49,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 12:55:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 182 [2024-11-12 12:55:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:55:49,123 INFO L225 Difference]: With dead ends: 408 [2024-11-12 12:55:49,123 INFO L226 Difference]: Without dead ends: 404 [2024-11-12 12:55:49,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 12:55:49,124 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 13 mSDsluCounter, 4249 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4638 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 12:55:49,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4638 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 12:55:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-12 12:55:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2024-11-12 12:55:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 383 states have (on average 1.2454308093994777) internal successors, (477), 391 states have internal predecessors, (477), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:55:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 503 transitions. [2024-11-12 12:55:49,134 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 503 transitions. Word has length 182 [2024-11-12 12:55:49,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:55:49,134 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 503 transitions. [2024-11-12 12:55:49,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.3076923076923075) internal successors, (190), 26 states have internal predecessors, (190), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:55:49,134 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 503 transitions. [2024-11-12 12:55:49,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-12 12:55:49,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:55:49,137 INFO L218 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:55:49,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-12 12:55:49,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:55:49,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:55:49,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:55:49,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1322308920, now seen corresponding path program 2 times [2024-11-12 12:55:49,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:55:49,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130792049] [2024-11-12 12:55:49,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:55:49,339 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-11-12 12:55:49,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:55:49,341 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:55:49,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 12:55:50,166 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:55:50,167 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:55:50,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 12:55:50,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:55:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-12 12:55:50,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:55:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 1 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-12 12:55:52,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:55:52,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130792049] [2024-11-12 12:55:52,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130792049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:55:52,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:55:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 12:55:52,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211487615] [2024-11-12 12:55:52,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:55:52,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 12:55:52,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:55:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 12:55:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 12:55:52,928 INFO L87 Difference]: Start difference. First operand 402 states and 503 transitions. Second operand has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:56:00,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:56:00,875 INFO L93 Difference]: Finished difference Result 442 states and 576 transitions. [2024-11-12 12:56:00,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 12:56:00,876 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 200 [2024-11-12 12:56:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:56:00,878 INFO L225 Difference]: With dead ends: 442 [2024-11-12 12:56:00,878 INFO L226 Difference]: Without dead ends: 438 [2024-11-12 12:56:00,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 12:56:00,881 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 26 mSDsluCounter, 8882 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9271 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-12 12:56:00,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9271 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-12 12:56:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-12 12:56:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-11-12 12:56:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 417 states have (on average 1.2541966426858513) internal successors, (523), 425 states have internal predecessors, (523), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:56:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 549 transitions. [2024-11-12 12:56:00,891 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 549 transitions. Word has length 200 [2024-11-12 12:56:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:56:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 549 transitions. [2024-11-12 12:56:00,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.28) internal successors, (214), 50 states have internal predecessors, (214), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:56:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 549 transitions. [2024-11-12 12:56:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-12 12:56:00,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:56:00,895 INFO L218 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:56:00,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 12:56:01,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:56:01,096 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:56:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:56:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -211123816, now seen corresponding path program 3 times [2024-11-12 12:56:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:56:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528384415] [2024-11-12 12:56:01,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 12:56:01,098 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-11-12 12:56:01,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:56:01,100 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:56:01,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 12:56:01,850 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 12:56:01,850 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:56:01,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:56:01,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:56:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-12 12:56:01,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:56:01,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:56:01,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528384415] [2024-11-12 12:56:01,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528384415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:56:01,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:56:01,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:56:01,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518244538] [2024-11-12 12:56:01,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:56:01,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:56:01,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:56:01,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:56:01,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:56:01,904 INFO L87 Difference]: Start difference. First operand 436 states and 549 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:56:02,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:56:02,010 INFO L93 Difference]: Finished difference Result 439 states and 544 transitions. [2024-11-12 12:56:02,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:56:02,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234 [2024-11-12 12:56:02,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:56:02,013 INFO L225 Difference]: With dead ends: 439 [2024-11-12 12:56:02,013 INFO L226 Difference]: Without dead ends: 439 [2024-11-12 12:56:02,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 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-11-12 12:56:02,014 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:56:02,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1073 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:56:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-12 12:56:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-11-12 12:56:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 420 states have (on average 1.2333333333333334) internal successors, (518), 428 states have internal predecessors, (518), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:56:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 544 transitions. [2024-11-12 12:56:02,025 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 544 transitions. Word has length 234 [2024-11-12 12:56:02,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:56:02,025 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 544 transitions. [2024-11-12 12:56:02,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:56:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 544 transitions. [2024-11-12 12:56:02,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-12 12:56:02,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:56:02,027 INFO L218 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:56:02,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 12:56:02,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:56:02,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:56:02,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:56:02,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1293509540, now seen corresponding path program 1 times [2024-11-12 12:56:02,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:56:02,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951988735] [2024-11-12 12:56:02,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:56:02,230 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-11-12 12:56:02,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:56:02,234 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:56:02,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 12:56:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:56:03,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 12:56:03,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:56:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:56:04,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:56:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:56:05,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:56:05,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951988735] [2024-11-12 12:56:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951988735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:56:05,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:56:05,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-12 12:56:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299118510] [2024-11-12 12:56:05,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:56:05,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 12:56:05,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:56:05,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 12:56:05,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 12:56:05,932 INFO L87 Difference]: Start difference. First operand 439 states and 544 transitions. Second operand has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 12:56:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:56:13,877 INFO L93 Difference]: Finished difference Result 468 states and 600 transitions. [2024-11-12 12:56:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-12 12:56:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 234 [2024-11-12 12:56:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:56:13,879 INFO L225 Difference]: With dead ends: 468 [2024-11-12 12:56:13,879 INFO L226 Difference]: Without dead ends: 468 [2024-11-12 12:56:13,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-12 12:56:13,882 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 26 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 9332 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 12:56:13,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9332 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 12:56:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-12 12:56:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2024-11-12 12:56:13,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 445 states have (on average 1.2764044943820225) internal successors, (568), 453 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-12 12:56:13,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 594 transitions. [2024-11-12 12:56:13,892 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 594 transitions. Word has length 234 [2024-11-12 12:56:13,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:56:13,893 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 594 transitions. [2024-11-12 12:56:13,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.076923076923077) internal successors, (212), 52 states have internal predecessors, (212), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 12:56:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 594 transitions. [2024-11-12 12:56:13,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-12 12:56:13,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:56:13,895 INFO L218 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-12 12:56:13,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 12:56:14,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:56:14,096 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:56:14,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:56:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 241673645, now seen corresponding path program 2 times [2024-11-12 12:56:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:56:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291970694] [2024-11-12 12:56:14,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:56:14,098 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-11-12 12:56:14,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:56:14,100 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:56:14,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 12:56:16,165 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:56:16,166 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:56:16,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 12:56:16,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:56:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:56:18,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:56:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:56:24,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:56:24,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291970694] [2024-11-12 12:56:24,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291970694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:56:24,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:56:24,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-12 12:56:24,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987418036] [2024-11-12 12:56:24,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:56:24,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-12 12:56:24,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:56:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-12 12:56:24,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-12 12:56:24,063 INFO L87 Difference]: Start difference. First operand 464 states and 594 transitions. Second operand has 102 states, 102 states have (on average 2.5686274509803924) internal successors, (262), 102 states have internal predecessors, (262), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)