./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc 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_JEN_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 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:18:34,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:18:34,167 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:18:34,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:18:34,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:18:34,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:18:34,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:18:34,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:18:34,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:18:34,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:18:34,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:18:34,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:18:34,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:18:34,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:18:34,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:18:34,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:18:34,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:18:34,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:18:34,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:18:34,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:18:34,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:18:34,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:18:34,220 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:18:34,220 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:18:34,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:18:34,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:18:34,221 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:18:34,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:18:34,221 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:18:34,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:18:34,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:18:34,222 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:18:34,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:18:34,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:18:34,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:18:34,223 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:18:34,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:18:34,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:18:34,226 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:18:34,226 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:18:34,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:18:34,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:18:34,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:18:34,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:18:34,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:18:34,227 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 -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2024-11-19 06:18:34,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:18:34,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:18:34,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:18:34,514 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:18:34,515 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:18:34,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-19 06:18:36,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:18:36,347 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:18:36,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-19 06:18:36,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363f6dbf2/131b69fe1d3c489ebe87143f9be56233/FLAG999e87b05 [2024-11-19 06:18:36,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/363f6dbf2/131b69fe1d3c489ebe87143f9be56233 [2024-11-19 06:18:36,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:18:36,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:18:36,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:18:36,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:18:36,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:18:36,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:18:36" (1/1) ... [2024-11-19 06:18:36,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@137a0be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:36, skipping insertion in model container [2024-11-19 06:18:36,396 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:18:36" (1/1) ... [2024-11-19 06:18:36,458 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:18:36,925 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-19 06:18:36,954 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-19 06:18:36,959 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-19 06:18:36,963 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-19 06:18:36,972 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-19 06:18:37,008 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-19 06:18:37,010 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-19 06:18:37,012 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-19 06:18:37,017 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-19 06:18:37,059 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-19 06:18:37,059 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-19 06:18:37,065 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-19 06:18:37,066 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-19 06:18:37,068 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-19 06:18:37,072 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-19 06:18:37,074 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-19 06:18:37,075 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-19 06:18:37,076 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-19 06:18:37,079 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-19 06:18:37,080 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-19 06:18:37,085 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-19 06:18:37,086 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-19 06:18:37,089 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-19 06:18:37,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:18:37,112 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-19 06:18:37,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7095c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:37, skipping insertion in model container [2024-11-19 06:18:37,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:18:37,113 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:18:37,115 INFO L158 Benchmark]: Toolchain (without parser) took 728.49ms. Allocated memory is still 172.0MB. Free memory was 109.7MB in the beginning and 81.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 06:18:37,115 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:18:37,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.47ms. Allocated memory is still 172.0MB. Free memory was 109.7MB in the beginning and 81.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 06:18:37,118 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.15ms. Allocated memory is still 172.0MB. Free memory is still 134.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.47ms. Allocated memory is still 172.0MB. Free memory was 109.7MB in the beginning and 81.8MB in the end (delta: 27.9MB). Peak memory consumption was 27.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_JEN_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 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:18:39,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:18:39,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:18:39,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:18:39,273 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:18:39,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:18:39,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:18:39,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:18:39,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:18:39,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:18:39,314 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:18:39,314 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:18:39,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:18:39,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:18:39,320 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:18:39,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:18:39,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:18:39,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:18:39,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:18:39,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:18:39,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:18:39,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:18:39,324 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:18:39,325 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:18:39,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:18:39,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:18:39,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:18:39,326 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:18:39,326 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:18:39,326 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:18:39,326 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:18:39,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:18:39,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:18:39,327 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:18:39,328 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:18:39,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:18:39,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:18:39,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:18:39,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:18:39,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:18:39,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:18:39,331 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:18:39,331 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:18:39,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:18:39,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:18:39,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:18:39,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:18:39,332 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 -> 85752dfa9e642a242de1661b045d725551498d8fafaaba42a5d915ccb8e5b948 [2024-11-19 06:18:39,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:18:39,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:18:39,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:18:39,675 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:18:39,676 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:18:39,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-19 06:18:41,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:18:41,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:18:41,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-3.i [2024-11-19 06:18:41,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bbc2aabe/899c4457e1504c59aad6d86f6532d192/FLAG50a6f8ea6 [2024-11-19 06:18:41,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bbc2aabe/899c4457e1504c59aad6d86f6532d192 [2024-11-19 06:18:41,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:18:41,725 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:18:41,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:18:41,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:18:41,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:18:41,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:18:41" (1/1) ... [2024-11-19 06:18:41,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@382eaa13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:41, skipping insertion in model container [2024-11-19 06:18:41,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:18:41" (1/1) ... [2024-11-19 06:18:41,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:18:42,316 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-19 06:18:42,364 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-19 06:18:42,372 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-19 06:18:42,380 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-19 06:18:42,386 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-19 06:18:42,432 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-19 06:18:42,435 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-19 06:18:42,438 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-19 06:18:42,444 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-19 06:18:42,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-19 06:18:42,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-19 06:18:42,482 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-19 06:18:42,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-19 06:18:42,489 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-19 06:18:42,491 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-19 06:18:42,493 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-19 06:18:42,493 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-19 06:18:42,494 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-19 06:18:42,506 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-19 06:18:42,510 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-19 06:18:42,510 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-19 06:18:42,511 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-19 06:18:42,518 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-19 06:18:42,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:18:42,552 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:18:42,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:18:42,585 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-19 06:18:42,604 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-19 06:18:42,606 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-19 06:18:42,609 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-19 06:18:42,616 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-19 06:18:42,640 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-19 06:18:42,642 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-19 06:18:42,644 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-19 06:18:42,648 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-19 06:18:42,666 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-19 06:18:42,667 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-19 06:18:42,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-19 06:18:42,669 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-19 06:18:42,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-19 06:18:42,672 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-19 06:18:42,672 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-19 06:18:42,673 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-19 06:18:42,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-19 06:18:42,676 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-19 06:18:42,677 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-19 06:18:42,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-19 06:18:42,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-19 06:18:42,682 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-19 06:18:42,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:18:42,694 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:18:42,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:18:42,869 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:18:42,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42 WrapperNode [2024-11-19 06:18:42,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:18:42,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:18:42,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:18:42,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:18:42,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:42,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,040 INFO L138 Inliner]: procedures = 180, calls = 474, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1728 [2024-11-19 06:18:43,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:18:43,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:18:43,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:18:43,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:18:43,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,230 INFO L175 MemorySlicer]: Split 443 memory accesses to 3 slices as follows [417, 2, 24]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 99 writes are split as follows [98, 0, 1]. [2024-11-19 06:18:43,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:18:43,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:18:43,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:18:43,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:18:43,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (1/1) ... [2024-11-19 06:18:43,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:18:43,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:18:43,431 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-19 06:18:43,436 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-19 06:18:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:18:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:18:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:18:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:18:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:18:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:18:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:18:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:18:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-19 06:18:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-19 06:18:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:18:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:18:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:18:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:18:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:18:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:18:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:18:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:18:43,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:18:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:18:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:18:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:18:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:18:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:18:43,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:18:43,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:18:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:18:43,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:18:43,814 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:18:58,576 INFO L? ?]: Removed 229 outVars from TransFormulas that were not future-live. [2024-11-19 06:18:58,577 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:18:58,606 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:18:58,607 INFO L316 CfgBuilder]: Removed 100 assume(true) statements. [2024-11-19 06:18:58,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:18:58 BoogieIcfgContainer [2024-11-19 06:18:58,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:18:58,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:18:58,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:18:58,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:18:58,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:18:41" (1/3) ... [2024-11-19 06:18:58,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35283bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:18:58, skipping insertion in model container [2024-11-19 06:18:58,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:18:42" (2/3) ... [2024-11-19 06:18:58,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35283bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:18:58, skipping insertion in model container [2024-11-19 06:18:58,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:18:58" (3/3) ... [2024-11-19 06:18:58,624 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-3.i [2024-11-19 06:18:58,641 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:18:58,642 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:18:58,709 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:18:58,717 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;@5ce3acd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:18:58,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:18:58,724 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-19 06:18:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-19 06:18:58,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:18:58,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:18:58,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:18:58,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:18:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 334886841, now seen corresponding path program 1 times [2024-11-19 06:18:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:18:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646715696] [2024-11-19 06:18:58,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:18:58,752 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-19 06:18:58,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:18:58,755 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-19 06:18:58,758 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-19 06:18:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:18:58,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:18:58,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:18:58,993 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-19 06:18:58,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:18:58,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:18:58,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646715696] [2024-11-19 06:18:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646715696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:18:58,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:18:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:18:58,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774664451] [2024-11-19 06:18:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:18:59,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:18:59,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:18:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:18:59,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:18:59,034 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-19 06:18:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:18:59,118 INFO L93 Difference]: Finished difference Result 321 states and 422 transitions. [2024-11-19 06:18:59,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:18:59,122 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-19 06:18:59,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:18:59,149 INFO L225 Difference]: With dead ends: 321 [2024-11-19 06:18:59,149 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 06:18:59,151 INFO L431 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-19 06:18:59,155 INFO L432 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-19 06:18:59,160 INFO L433 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-19 06:18:59,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 06:18:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-19 06:18:59,259 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-19 06:18:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 420 transitions. [2024-11-19 06:18:59,267 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 420 transitions. Word has length 10 [2024-11-19 06:18:59,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:18:59,267 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 420 transitions. [2024-11-19 06:18:59,267 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-19 06:18:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 420 transitions. [2024-11-19 06:18:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:18:59,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:18:59,272 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:18:59,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:18:59,473 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-19 06:18:59,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:18:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:18:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 909565367, now seen corresponding path program 1 times [2024-11-19 06:18:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:18:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419193986] [2024-11-19 06:18:59,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:18:59,475 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-19 06:18:59,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:18:59,478 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-19 06:18:59,479 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-19 06:18:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:18:59,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:18:59,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:18:59,719 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-19 06:18:59,723 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:18:59,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:18:59,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419193986] [2024-11-19 06:18:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419193986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:18:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:18:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:18:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929082968] [2024-11-19 06:18:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:18:59,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:18:59,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:18:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:18:59,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:18:59,729 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-19 06:19:00,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:00,007 INFO L93 Difference]: Finished difference Result 566 states and 749 transitions. [2024-11-19 06:19:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:19:00,012 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-19 06:19:00,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:00,017 INFO L225 Difference]: With dead ends: 566 [2024-11-19 06:19:00,018 INFO L226 Difference]: Without dead ends: 566 [2024-11-19 06:19:00,019 INFO L431 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-19 06:19:00,020 INFO L432 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-19 06:19:00,020 INFO L433 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-19 06:19:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-11-19 06:19:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 321. [2024-11-19 06:19:00,041 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-19 06:19:00,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 422 transitions. [2024-11-19 06:19:00,043 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 422 transitions. Word has length 11 [2024-11-19 06:19:00,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:00,044 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 422 transitions. [2024-11-19 06:19:00,044 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-19 06:19:00,044 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 422 transitions. [2024-11-19 06:19:00,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 06:19:00,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:00,049 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:19:00,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:19:00,252 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-19 06:19:00,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:00,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:00,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1663298653, now seen corresponding path program 1 times [2024-11-19 06:19:00,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844914251] [2024-11-19 06:19:00,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:00,258 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-19 06:19:00,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:00,262 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-19 06:19:00,263 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-19 06:19:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:00,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:19:00,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:00,986 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-19 06:19:00,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:19:00,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:00,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844914251] [2024-11-19 06:19:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844914251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:19:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:19:00,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:19:00,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15863868] [2024-11-19 06:19:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:19:00,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:19:00,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:19:00,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:19:00,990 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-19 06:19:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:01,113 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2024-11-19 06:19:01,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:19:01,114 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-19 06:19:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:01,115 INFO L225 Difference]: With dead ends: 324 [2024-11-19 06:19:01,115 INFO L226 Difference]: Without dead ends: 324 [2024-11-19 06:19:01,116 INFO L431 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-19 06:19:01,117 INFO L432 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-19 06:19:01,117 INFO L433 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-19 06:19:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-19 06:19:01,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-19 06:19:01,129 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-19 06:19:01,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2024-11-19 06:19:01,130 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 152 [2024-11-19 06:19:01,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:01,131 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2024-11-19 06:19:01,131 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-19 06:19:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2024-11-19 06:19:01,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 06:19:01,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:01,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:19:01,151 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-19 06:19:01,334 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-19 06:19:01,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:01,336 INFO L85 PathProgramCache]: Analyzing trace with hash -287494633, now seen corresponding path program 1 times [2024-11-19 06:19:01,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:01,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604119248] [2024-11-19 06:19:01,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:01,337 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-19 06:19:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:01,340 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-19 06:19:01,342 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-19 06:19:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:01,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:19:01,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:02,190 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-19 06:19:02,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:19:02,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:02,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604119248] [2024-11-19 06:19:02,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604119248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:19:02,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:19:02,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:19:02,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508488074] [2024-11-19 06:19:02,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:19:02,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:19:02,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:02,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:19:02,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:19:02,196 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-19 06:19:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:02,775 INFO L93 Difference]: Finished difference Result 420 states and 534 transitions. [2024-11-19 06:19:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:19:02,777 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-19 06:19:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:02,779 INFO L225 Difference]: With dead ends: 420 [2024-11-19 06:19:02,779 INFO L226 Difference]: Without dead ends: 420 [2024-11-19 06:19:02,779 INFO L431 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-19 06:19:02,781 INFO L432 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-19 06:19:02,781 INFO L433 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-19 06:19:02,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-19 06:19:02,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 366. [2024-11-19 06:19:02,795 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-19 06:19:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 463 transitions. [2024-11-19 06:19:02,796 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 463 transitions. Word has length 152 [2024-11-19 06:19:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:02,799 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 463 transitions. [2024-11-19 06:19:02,799 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-19 06:19:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 463 transitions. [2024-11-19 06:19:02,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-19 06:19:02,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:02,805 INFO L215 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-19 06:19:02,818 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-19 06:19:03,006 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-19 06:19:03,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:03,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:03,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1579481837, now seen corresponding path program 1 times [2024-11-19 06:19:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:03,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297133493] [2024-11-19 06:19:03,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:03,008 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-19 06:19:03,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:03,011 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-19 06:19:03,012 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-19 06:19:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:03,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:19:03,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:03,657 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-19 06:19:03,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:19:03,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:03,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297133493] [2024-11-19 06:19:03,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297133493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:19:03,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:19:03,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:19:03,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084985634] [2024-11-19 06:19:03,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:19:03,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:19:03,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:19:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:19:03,664 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-19 06:19:03,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:03,723 INFO L93 Difference]: Finished difference Result 369 states and 468 transitions. [2024-11-19 06:19:03,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:19:03,724 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-19 06:19:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:03,726 INFO L225 Difference]: With dead ends: 369 [2024-11-19 06:19:03,728 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 06:19:03,728 INFO L431 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-19 06:19:03,729 INFO L432 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:03,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1208 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:19:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 06:19:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-19 06:19:03,738 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-19 06:19:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 468 transitions. [2024-11-19 06:19:03,740 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 468 transitions. Word has length 167 [2024-11-19 06:19:03,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:03,740 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 468 transitions. [2024-11-19 06:19:03,740 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-19 06:19:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 468 transitions. [2024-11-19 06:19:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-19 06:19:03,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:03,743 INFO L215 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-19 06:19:03,758 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-19 06:19:03,944 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-19 06:19:03,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:03,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:03,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1774013781, now seen corresponding path program 1 times [2024-11-19 06:19:03,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:03,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983339507] [2024-11-19 06:19:03,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:03,946 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-19 06:19:03,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:03,948 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-19 06:19:03,949 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-19 06:19:04,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:04,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:19:04,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:04,648 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-19 06:19:04,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:19:04,734 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-19 06:19:04,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:04,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983339507] [2024-11-19 06:19:04,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983339507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:19:04,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:19:04,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:19:04,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254277644] [2024-11-19 06:19:04,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:19:04,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:19:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:04,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:19:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:19:04,738 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-19 06:19:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:04,924 INFO L93 Difference]: Finished difference Result 380 states and 485 transitions. [2024-11-19 06:19:04,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:19:04,925 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-19 06:19:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:04,927 INFO L225 Difference]: With dead ends: 380 [2024-11-19 06:19:04,927 INFO L226 Difference]: Without dead ends: 380 [2024-11-19 06:19:04,928 INFO L431 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-19 06:19:04,928 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 5 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:04,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2002 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:19:04,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-19 06:19:04,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2024-11-19 06:19:04,936 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-19 06:19:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 482 transitions. [2024-11-19 06:19:04,938 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 482 transitions. Word has length 169 [2024-11-19 06:19:04,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:04,938 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 482 transitions. [2024-11-19 06:19:04,939 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-19 06:19:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 482 transitions. [2024-11-19 06:19:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-19 06:19:04,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:04,941 INFO L215 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-19 06:19:04,963 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-19 06:19:05,141 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-19 06:19:05,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:05,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:05,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1113401101, now seen corresponding path program 2 times [2024-11-19 06:19:05,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:05,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219113907] [2024-11-19 06:19:05,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:19:05,145 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-19 06:19:05,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:05,148 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-19 06:19:05,149 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-19 06:19:05,583 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:19:05,583 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:19:05,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:19:05,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:05,617 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-19 06:19:05,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:19:05,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:05,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219113907] [2024-11-19 06:19:05,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219113907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:19:05,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:19:05,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:19:05,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390863016] [2024-11-19 06:19:05,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:19:05,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:19:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:19:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:19:05,620 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-19 06:19:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:05,709 INFO L93 Difference]: Finished difference Result 381 states and 477 transitions. [2024-11-19 06:19:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:19:05,710 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-19 06:19:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:05,712 INFO L225 Difference]: With dead ends: 381 [2024-11-19 06:19:05,712 INFO L226 Difference]: Without dead ends: 381 [2024-11-19 06:19:05,712 INFO L431 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-19 06:19:05,713 INFO L432 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-19 06:19:05,713 INFO L433 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-19 06:19:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-19 06:19:05,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-19 06:19:05,721 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-19 06:19:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 477 transitions. [2024-11-19 06:19:05,723 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 477 transitions. Word has length 173 [2024-11-19 06:19:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:05,724 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 477 transitions. [2024-11-19 06:19:05,724 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-19 06:19:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 477 transitions. [2024-11-19 06:19:05,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-19 06:19:05,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:05,726 INFO L215 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-19 06:19:05,735 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 (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:19:05,930 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-19 06:19:05,931 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:05,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:05,932 INFO L85 PathProgramCache]: Analyzing trace with hash -529249861, now seen corresponding path program 1 times [2024-11-19 06:19:05,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:05,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035171684] [2024-11-19 06:19:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:05,933 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-19 06:19:05,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:05,935 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-19 06:19:05,936 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-19 06:19:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:06,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:19:06,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:06,707 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-19 06:19:06,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:19:06,929 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-19 06:19:06,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035171684] [2024-11-19 06:19:06,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035171684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:19:06,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:19:06,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:19:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657358440] [2024-11-19 06:19:06,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:19:06,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:19:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:19:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:19:06,932 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-19 06:19:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:07,462 INFO L93 Difference]: Finished difference Result 396 states and 500 transitions. [2024-11-19 06:19:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:19:07,463 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-19 06:19:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:07,466 INFO L225 Difference]: With dead ends: 396 [2024-11-19 06:19:07,466 INFO L226 Difference]: Without dead ends: 392 [2024-11-19 06:19:07,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:19:07,467 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 8 mSDsluCounter, 2340 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:07,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2733 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:19:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-19 06:19:07,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-19 06:19:07,478 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-19 06:19:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 489 transitions. [2024-11-19 06:19:07,481 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 489 transitions. Word has length 173 [2024-11-19 06:19:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:07,482 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 489 transitions. [2024-11-19 06:19:07,482 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-19 06:19:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 489 transitions. [2024-11-19 06:19:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 06:19:07,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:07,485 INFO L215 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-19 06:19:07,505 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-19 06:19:07,685 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-19 06:19:07,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:07,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2105872474, now seen corresponding path program 2 times [2024-11-19 06:19:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:07,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102695900] [2024-11-19 06:19:07,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:19:07,689 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-19 06:19:07,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:07,690 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-19 06:19:07,691 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-19 06:19:08,109 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:19:08,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:19:08,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:19:08,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:08,183 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-19 06:19:08,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:19:08,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102695900] [2024-11-19 06:19:08,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102695900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:19:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:19:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:19:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804805344] [2024-11-19 06:19:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:19:08,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:19:08,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:19:08,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:19:08,185 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-19 06:19:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:08,243 INFO L93 Difference]: Finished difference Result 384 states and 479 transitions. [2024-11-19 06:19:08,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:19:08,244 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-19 06:19:08,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:08,247 INFO L225 Difference]: With dead ends: 384 [2024-11-19 06:19:08,247 INFO L226 Difference]: Without dead ends: 384 [2024-11-19 06:19:08,247 INFO L431 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-19 06:19:08,248 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 8 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:08,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1115 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:19:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-19 06:19:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-19 06:19:08,258 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-19 06:19:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 479 transitions. [2024-11-19 06:19:08,260 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 479 transitions. Word has length 182 [2024-11-19 06:19:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:08,261 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 479 transitions. [2024-11-19 06:19:08,261 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-19 06:19:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 479 transitions. [2024-11-19 06:19:08,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-19 06:19:08,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:08,264 INFO L215 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-19 06:19:08,276 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-19 06:19:08,468 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-19 06:19:08,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1643766688, now seen corresponding path program 1 times [2024-11-19 06:19:08,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [377265764] [2024-11-19 06:19:08,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:08,471 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-19 06:19:08,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:08,472 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-19 06:19:08,474 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-19 06:19:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:09,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:19:09,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:09,408 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-19 06:19:09,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:19:09,943 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-19 06:19:09,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:09,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [377265764] [2024-11-19 06:19:09,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [377265764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:19:09,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:19:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:19:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563316289] [2024-11-19 06:19:09,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:19:09,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:19:09,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:09,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:19:09,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:19:09,946 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-19 06:19:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:11,429 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2024-11-19 06:19:11,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:19:11,430 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-19 06:19:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:11,432 INFO L225 Difference]: With dead ends: 408 [2024-11-19 06:19:11,432 INFO L226 Difference]: Without dead ends: 404 [2024-11-19 06:19:11,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:19:11,433 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 13 mSDsluCounter, 4249 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:11,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4638 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:19:11,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-19 06:19:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2024-11-19 06:19:11,441 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-19 06:19:11,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 503 transitions. [2024-11-19 06:19:11,443 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 503 transitions. Word has length 182 [2024-11-19 06:19:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 503 transitions. [2024-11-19 06:19:11,443 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-19 06:19:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 503 transitions. [2024-11-19 06:19:11,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-19 06:19:11,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:11,446 INFO L215 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-19 06:19:11,464 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-19 06:19:11,646 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-19 06:19:11,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1742285632, now seen corresponding path program 2 times [2024-11-19 06:19:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573591302] [2024-11-19 06:19:11,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:19:11,648 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-19 06:19:11,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:11,650 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-19 06:19:11,650 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-19 06:19:12,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:19:12,485 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:19:12,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:19:12,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:13,074 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-19 06:19:13,074 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:19:14,481 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-19 06:19:14,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:14,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573591302] [2024-11-19 06:19:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573591302] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:19:14,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:19:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:19:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159967452] [2024-11-19 06:19:14,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:19:14,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:19:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:14,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:19:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:19:14,484 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-19 06:19:20,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:20,792 INFO L93 Difference]: Finished difference Result 442 states and 576 transitions. [2024-11-19 06:19:20,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:19:20,793 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-19 06:19:20,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:20,795 INFO L225 Difference]: With dead ends: 442 [2024-11-19 06:19:20,795 INFO L226 Difference]: Without dead ends: 438 [2024-11-19 06:19:20,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:19:20,798 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 26 mSDsluCounter, 8882 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9271 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 06:19:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-19 06:19:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 436. [2024-11-19 06:19:20,805 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-19 06:19:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 549 transitions. [2024-11-19 06:19:20,807 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 549 transitions. Word has length 200 [2024-11-19 06:19:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:20,808 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 549 transitions. [2024-11-19 06:19:20,808 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-19 06:19:20,808 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 549 transitions. [2024-11-19 06:19:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-19 06:19:20,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:20,811 INFO L215 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-19 06:19:20,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 06:19:21,011 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-19 06:19:21,012 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1349224096, now seen corresponding path program 3 times [2024-11-19 06:19:21,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:21,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141423117] [2024-11-19 06:19:21,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:19:21,014 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-19 06:19:21,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:21,015 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-19 06:19:21,016 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-19 06:19:21,764 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:19:21,764 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:19:21,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:19:21,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:21,806 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-19 06:19:21,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:19:21,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141423117] [2024-11-19 06:19:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141423117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:19:21,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:19:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:19:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382156063] [2024-11-19 06:19:21,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:19:21,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:19:21,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:21,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:19:21,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:19:21,808 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-19 06:19:21,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:21,878 INFO L93 Difference]: Finished difference Result 439 states and 544 transitions. [2024-11-19 06:19:21,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:19:21,879 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-19 06:19:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:21,881 INFO L225 Difference]: With dead ends: 439 [2024-11-19 06:19:21,881 INFO L226 Difference]: Without dead ends: 439 [2024-11-19 06:19:21,881 INFO L431 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-19 06:19:21,882 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 30 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-19 06:19:21,882 INFO L433 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-19 06:19:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-19 06:19:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-11-19 06:19:21,889 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-19 06:19:21,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 544 transitions. [2024-11-19 06:19:21,890 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 544 transitions. Word has length 234 [2024-11-19 06:19:21,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:21,890 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 544 transitions. [2024-11-19 06:19:21,891 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-19 06:19:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 544 transitions. [2024-11-19 06:19:21,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-19 06:19:21,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:21,892 INFO L215 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-19 06:19:21,909 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-19 06:19:22,093 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-19 06:19:22,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1441109844, now seen corresponding path program 1 times [2024-11-19 06:19:22,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:22,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859825822] [2024-11-19 06:19:22,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:19:22,095 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-19 06:19:22,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:22,096 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-19 06:19:22,097 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-19 06:19:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:19:23,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 1454 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:19:23,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:23,937 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-19 06:19:23,937 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:19:25,709 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-19 06:19:25,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:25,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859825822] [2024-11-19 06:19:25,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859825822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:19:25,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:19:25,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:19:25,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373695967] [2024-11-19 06:19:25,710 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:19:25,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:19:25,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:25,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:19:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:19:25,712 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-19 06:19:32,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:19:32,631 INFO L93 Difference]: Finished difference Result 468 states and 600 transitions. [2024-11-19 06:19:32,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:19:32,632 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-19 06:19:32,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:19:32,634 INFO L225 Difference]: With dead ends: 468 [2024-11-19 06:19:32,634 INFO L226 Difference]: Without dead ends: 468 [2024-11-19 06:19:32,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:19:32,637 INFO L432 NwaCegarLoop]: 377 mSDtfsCounter, 26 mSDsluCounter, 8955 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:19:32,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 9332 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1495 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 06:19:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-19 06:19:32,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2024-11-19 06:19:32,649 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-19 06:19:32,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 594 transitions. [2024-11-19 06:19:32,651 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 594 transitions. Word has length 234 [2024-11-19 06:19:32,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:19:32,652 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 594 transitions. [2024-11-19 06:19:32,652 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-19 06:19:32,652 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 594 transitions. [2024-11-19 06:19:32,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-19 06:19:32,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:19:32,654 INFO L215 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-19 06:19:32,685 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-19 06:19:32,854 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-19 06:19:32,855 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:19:32,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:19:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1118422355, now seen corresponding path program 2 times [2024-11-19 06:19:32,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:19:32,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498366529] [2024-11-19 06:19:32,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:19:32,857 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-19 06:19:32,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:19:32,858 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-19 06:19:32,860 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-19 06:19:34,970 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:19:34,970 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:19:35,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1729 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:19:35,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:19:36,759 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-19 06:19:36,759 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:19:43,530 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-19 06:19:43,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:19:43,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498366529] [2024-11-19 06:19:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498366529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:19:43,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:19:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:19:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892055201] [2024-11-19 06:19:43,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:19:43,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:19:43,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:19:43,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:19:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:19:43,536 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)