./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:35:51,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:35:51,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:35:51,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:35:51,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:35:51,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:35:51,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:35:51,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:35:51,519 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:35:51,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:35:51,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:35:51,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:35:51,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:35:51,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:35:51,523 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:35:51,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:35:51,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:35:51,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:35:51,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:35:51,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:35:51,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:35:51,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:35:51,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:35:51,530 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:35:51,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:35:51,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:35:51,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:35:51,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:35:51,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:35:51,532 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:35:51,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:35:51,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:35:51,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:35:51,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:35:51,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:35:51,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:35:51,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:51,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:35:51,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:35:51,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:35:51,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:35:51,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:35:51,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:35:51,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:35:51,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:35:51,537 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-14 17:35:51,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:35:51,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:35:51,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:35:51,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:35:51,802 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:35:51,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-10-14 17:35:53,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:35:53,446 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:35:53,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-10-14 17:35:53,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33147d473/221f1b4ddef94c8783e27fa12a66f096/FLAG06902a40c [2024-10-14 17:35:53,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33147d473/221f1b4ddef94c8783e27fa12a66f096 [2024-10-14 17:35:53,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:35:53,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:35:53,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:53,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:35:53,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:35:53,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:53" (1/1) ... [2024-10-14 17:35:53,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3666d7bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:53, skipping insertion in model container [2024-10-14 17:35:53,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:53" (1/1) ... [2024-10-14 17:35:53,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:54,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:54,050 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 17:35:54,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6245461b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:54, skipping insertion in model container [2024-10-14 17:35:54,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:54,052 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:35:54,054 INFO L158 Benchmark]: Toolchain (without parser) took 571.84ms. Allocated memory is still 163.6MB. Free memory was 107.0MB in the beginning and 85.4MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:35:54,054 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:35:54,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.40ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 85.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 17:35:54,056 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 163.6MB. Free memory is still 97.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.40ms. Allocated memory is still 163.6MB. Free memory was 106.3MB in the beginning and 85.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:35:55,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:35:56,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:35:56,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:35:56,048 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:35:56,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:35:56,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:35:56,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:35:56,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:35:56,091 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:35:56,091 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:35:56,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:35:56,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:35:56,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:35:56,094 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:35:56,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:35:56,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:35:56,097 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:35:56,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:35:56,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:35:56,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:35:56,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:35:56,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:35:56,102 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:35:56,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:35:56,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:35:56,102 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:35:56,102 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:35:56,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:35:56,103 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:35:56,103 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:35:56,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:35:56,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:35:56,104 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:35:56,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:35:56,107 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:35:56,107 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:35:56,107 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:35:56,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:56,108 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:35:56,108 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:35:56,109 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:35:56,109 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:35:56,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:35:56,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:35:56,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:35:56,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:35:56,110 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:35:56,110 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-10-14 17:35:56,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:35:56,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:35:56,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:35:56,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:35:56,476 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:35:56,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-10-14 17:35:58,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:35:58,429 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:35:58,430 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test4-1.i [2024-10-14 17:35:58,454 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a9df6fd/bf4622ce85504c5aac79f6d91f402d04/FLAG67ddb51a0 [2024-10-14 17:35:58,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0a9df6fd/bf4622ce85504c5aac79f6d91f402d04 [2024-10-14 17:35:58,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:35:58,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:35:58,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:58,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:35:58,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:35:58,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:58" (1/1) ... [2024-10-14 17:35:58,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fd3f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:58, skipping insertion in model container [2024-10-14 17:35:58,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:35:58" (1/1) ... [2024-10-14 17:35:58,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:59,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:59,114 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:35:59,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:35:59,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:59,241 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:35:59,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:35:59,382 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:35:59,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59 WrapperNode [2024-10-14 17:35:59,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:35:59,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:35:59,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:35:59,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:35:59,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,511 INFO L138 Inliner]: procedures = 179, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1132 [2024-10-14 17:35:59,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:35:59,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:35:59,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:35:59,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:35:59,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,525 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,655 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-10-14 17:35:59,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,737 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:35:59,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:35:59,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:35:59,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:35:59,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (1/1) ... [2024-10-14 17:35:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:35:59,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:35:59,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:35:59,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:35:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:35:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:35:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:35:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:35:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 17:35:59,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 17:35:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 17:35:59,826 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 17:35:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:35:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:35:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:35:59,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:35:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:35:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:35:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:35:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:35:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:35:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:35:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:35:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:35:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:36:00,065 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:36:00,068 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:36:12,316 INFO L? ?]: Removed 173 outVars from TransFormulas that were not future-live. [2024-10-14 17:36:12,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:36:12,349 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:36:12,349 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-14 17:36:12,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:36:12 BoogieIcfgContainer [2024-10-14 17:36:12,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:36:12,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:36:12,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:36:12,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:36:12,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:35:58" (1/3) ... [2024-10-14 17:36:12,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1312b4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:36:12, skipping insertion in model container [2024-10-14 17:36:12,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:35:59" (2/3) ... [2024-10-14 17:36:12,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1312b4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:36:12, skipping insertion in model container [2024-10-14 17:36:12,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:36:12" (3/3) ... [2024-10-14 17:36:12,357 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test4-1.i [2024-10-14 17:36:12,371 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:36:12,371 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:36:12,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:36:12,430 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;@686840f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:36:12,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:36:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 183 states have (on average 1.6666666666666667) internal successors, (305), 185 states have internal predecessors, (305), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:36:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:36:12,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:12,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:36:12,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:12,447 INFO L85 PathProgramCache]: Analyzing trace with hash 803871, now seen corresponding path program 1 times [2024-10-14 17:36:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:12,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515966003] [2024-10-14 17:36:12,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:12,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:12,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:12,461 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:12,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 17:36:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:12,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:36:12,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:36:12,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:12,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515966003] [2024-10-14 17:36:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515966003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:12,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:12,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 17:36:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784061398] [2024-10-14 17:36:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:12,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:36:12,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:12,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:36:12,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:36:12,715 INFO L87 Difference]: Start difference. First operand has 193 states, 183 states have (on average 1.6666666666666667) internal successors, (305), 185 states have internal predecessors, (305), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:16,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:20,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:21,536 INFO L93 Difference]: Finished difference Result 204 states and 262 transitions. [2024-10-14 17:36:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:36:21,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2024-10-14 17:36:21,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:21,556 INFO L225 Difference]: With dead ends: 204 [2024-10-14 17:36:21,557 INFO L226 Difference]: Without dead ends: 201 [2024-10-14 17:36:21,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:36:21,562 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 14 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:21,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-10-14 17:36:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-14 17:36:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2024-10-14 17:36:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 190 states have internal predecessors, (243), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:36:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2024-10-14 17:36:21,615 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 3 [2024-10-14 17:36:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:21,616 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2024-10-14 17:36:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2024-10-14 17:36:21,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:36:21,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:21,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:21,620 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-10-14 17:36:21,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:21,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:21,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:21,818 INFO L85 PathProgramCache]: Analyzing trace with hash 986954024, now seen corresponding path program 1 times [2024-10-14 17:36:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:21,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486713250] [2024-10-14 17:36:21,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:21,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:21,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:21,822 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:21,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 17:36:21,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:21,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:36:21,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:22,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:36:22,042 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:22,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:22,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486713250] [2024-10-14 17:36:22,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486713250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:22,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:22,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:36:22,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312974070] [2024-10-14 17:36:22,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:22,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:22,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:22,045 INFO L87 Difference]: Start difference. First operand 198 states and 255 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:26,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:30,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:36,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:37,667 INFO L93 Difference]: Finished difference Result 318 states and 410 transitions. [2024-10-14 17:36:37,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:36:37,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 17:36:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:37,672 INFO L225 Difference]: With dead ends: 318 [2024-10-14 17:36:37,672 INFO L226 Difference]: Without dead ends: 316 [2024-10-14 17:36:37,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:37,675 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 156 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:37,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 656 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 15.6s Time] [2024-10-14 17:36:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-10-14 17:36:37,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2024-10-14 17:36:37,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 304 states have (on average 1.2828947368421053) internal successors, (390), 305 states have internal predecessors, (390), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 17:36:37,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 408 transitions. [2024-10-14 17:36:37,712 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 408 transitions. Word has length 10 [2024-10-14 17:36:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:37,713 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 408 transitions. [2024-10-14 17:36:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:36:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 408 transitions. [2024-10-14 17:36:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 17:36:37,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:37,723 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 17:36:37,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 17:36:37,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:37,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:37,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:37,925 INFO L85 PathProgramCache]: Analyzing trace with hash -165551854, now seen corresponding path program 1 times [2024-10-14 17:36:37,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:37,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387060901] [2024-10-14 17:36:37,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:37,926 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:37,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:37,930 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:37,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 17:36:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:38,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:38,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:38,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:38,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:38,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:38,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387060901] [2024-10-14 17:36:38,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387060901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:38,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:38,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:36:38,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441405947] [2024-10-14 17:36:38,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:38,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:36:38,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:36:38,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:38,648 INFO L87 Difference]: Start difference. First operand 316 states and 408 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:38,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:38,765 INFO L93 Difference]: Finished difference Result 322 states and 398 transitions. [2024-10-14 17:36:38,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2024-10-14 17:36:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:38,767 INFO L225 Difference]: With dead ends: 322 [2024-10-14 17:36:38,769 INFO L226 Difference]: Without dead ends: 322 [2024-10-14 17:36:38,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 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-10-14 17:36:38,770 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 33 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:38,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 615 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:38,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-10-14 17:36:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2024-10-14 17:36:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 310 states have (on average 1.2258064516129032) internal successors, (380), 311 states have internal predecessors, (380), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 17:36:38,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 398 transitions. [2024-10-14 17:36:38,788 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 398 transitions. Word has length 126 [2024-10-14 17:36:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 398 transitions. [2024-10-14 17:36:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 398 transitions. [2024-10-14 17:36:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 17:36:38,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:38,792 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 17:36:38,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:38,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:38,993 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:38,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:38,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2096450624, now seen corresponding path program 1 times [2024-10-14 17:36:38,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:38,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714107466] [2024-10-14 17:36:38,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:38,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:38,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:38,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:39,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 17:36:39,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:39,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:39,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:39,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:39,632 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:39,632 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:39,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714107466] [2024-10-14 17:36:39,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714107466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:39,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:39,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:39,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652165202] [2024-10-14 17:36:39,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:39,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:39,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:39,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:39,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:39,637 INFO L87 Difference]: Start difference. First operand 322 states and 398 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:39,749 INFO L93 Difference]: Finished difference Result 310 states and 378 transitions. [2024-10-14 17:36:39,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:36:39,750 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2024-10-14 17:36:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:39,752 INFO L225 Difference]: With dead ends: 310 [2024-10-14 17:36:39,752 INFO L226 Difference]: Without dead ends: 310 [2024-10-14 17:36:39,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:36:39,755 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 9 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:39,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 616 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-14 17:36:39,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-14 17:36:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 298 states have (on average 1.2080536912751678) internal successors, (360), 299 states have internal predecessors, (360), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 17:36:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 378 transitions. [2024-10-14 17:36:39,770 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 378 transitions. Word has length 126 [2024-10-14 17:36:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:39,771 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 378 transitions. [2024-10-14 17:36:39,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 378 transitions. [2024-10-14 17:36:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-14 17:36:39,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:39,778 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 17:36:39,794 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:36:39,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:39,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:39,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash 835895752, now seen corresponding path program 1 times [2024-10-14 17:36:39,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:39,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909133773] [2024-10-14 17:36:39,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:39,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:39,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:39,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:39,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 17:36:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:40,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:40,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:36:41,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:41,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:41,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909133773] [2024-10-14 17:36:41,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909133773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:41,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:41,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:36:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002504978] [2024-10-14 17:36:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:41,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:36:41,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:41,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:36:41,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:36:41,050 INFO L87 Difference]: Start difference. First operand 310 states and 378 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:41,479 INFO L93 Difference]: Finished difference Result 308 states and 375 transitions. [2024-10-14 17:36:41,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:36:41,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 126 [2024-10-14 17:36:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:41,487 INFO L225 Difference]: With dead ends: 308 [2024-10-14 17:36:41,487 INFO L226 Difference]: Without dead ends: 308 [2024-10-14 17:36:41,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:36:41,488 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:41,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 445 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:36:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-14 17:36:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-14 17:36:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 296 states have (on average 1.2060810810810811) internal successors, (357), 297 states have internal predecessors, (357), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-14 17:36:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 375 transitions. [2024-10-14 17:36:41,496 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 375 transitions. Word has length 126 [2024-10-14 17:36:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:41,497 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 375 transitions. [2024-10-14 17:36:41,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 17:36:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 375 transitions. [2024-10-14 17:36:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 17:36:41,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:41,499 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:41,515 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-10-14 17:36:41,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:41,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:41,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash -193607656, now seen corresponding path program 1 times [2024-10-14 17:36:41,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:41,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554044517] [2024-10-14 17:36:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:41,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:41,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:41,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:41,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 17:36:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:42,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:36:42,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:42,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 17:36:42,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:42,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:42,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554044517] [2024-10-14 17:36:42,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554044517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:42,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080942786] [2024-10-14 17:36:42,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:42,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:42,408 INFO L87 Difference]: Start difference. First operand 308 states and 375 transitions. Second operand has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:42,507 INFO L93 Difference]: Finished difference Result 310 states and 380 transitions. [2024-10-14 17:36:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:36:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-10-14 17:36:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:42,511 INFO L225 Difference]: With dead ends: 310 [2024-10-14 17:36:42,511 INFO L226 Difference]: Without dead ends: 310 [2024-10-14 17:36:42,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:42,512 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:42,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 665 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:36:42,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-14 17:36:42,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-10-14 17:36:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 297 states have (on average 1.2087542087542087) internal successors, (359), 299 states have internal predecessors, (359), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 17:36:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 380 transitions. [2024-10-14 17:36:42,522 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 380 transitions. Word has length 139 [2024-10-14 17:36:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:42,523 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 380 transitions. [2024-10-14 17:36:42,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 states have internal predecessors, (127), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-14 17:36:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 380 transitions. [2024-10-14 17:36:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-14 17:36:42,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:42,525 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:42,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 17:36:42,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:42,726 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:42,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash 271945928, now seen corresponding path program 1 times [2024-10-14 17:36:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:42,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819529687] [2024-10-14 17:36:42,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:36:42,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:42,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:42,729 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:42,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 17:36:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:36:43,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:43,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 17:36:43,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 17:36:43,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:43,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819529687] [2024-10-14 17:36:43,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819529687] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:43,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:43,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:36:43,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787348122] [2024-10-14 17:36:43,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:43,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:36:43,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:43,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:36:43,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:36:43,623 INFO L87 Difference]: Start difference. First operand 310 states and 380 transitions. Second operand has 8 states, 6 states have (on average 22.5) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:36:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:43,933 INFO L93 Difference]: Finished difference Result 319 states and 396 transitions. [2024-10-14 17:36:43,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:36:43,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 22.5) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 143 [2024-10-14 17:36:43,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:43,938 INFO L225 Difference]: With dead ends: 319 [2024-10-14 17:36:43,938 INFO L226 Difference]: Without dead ends: 319 [2024-10-14 17:36:43,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:36:43,939 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 4 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:43,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1313 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:36:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-14 17:36:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2024-10-14 17:36:43,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 304 states have (on average 1.2236842105263157) internal successors, (372), 306 states have internal predecessors, (372), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 17:36:43,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 393 transitions. [2024-10-14 17:36:43,956 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 393 transitions. Word has length 143 [2024-10-14 17:36:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:43,957 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 393 transitions. [2024-10-14 17:36:43,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 22.5) internal successors, (135), 8 states have internal predecessors, (135), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:36:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 393 transitions. [2024-10-14 17:36:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-10-14 17:36:43,959 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:43,959 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:43,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:36:44,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:44,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:44,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:44,161 INFO L85 PathProgramCache]: Analyzing trace with hash -511691496, now seen corresponding path program 2 times [2024-10-14 17:36:44,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:44,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815894987] [2024-10-14 17:36:44,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:36:44,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:44,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:44,163 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:44,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 17:36:44,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:36:44,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:44,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 17:36:44,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-14 17:36:44,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:36:45,333 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-10-14 17:36:45,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:45,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815894987] [2024-10-14 17:36:45,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815894987] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:36:45,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:36:45,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:36:45,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932287783] [2024-10-14 17:36:45,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:36:45,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:36:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:45,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:36:45,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:36:45,337 INFO L87 Difference]: Start difference. First operand 318 states and 393 transitions. Second operand has 14 states, 12 states have (on average 11.75) internal successors, (141), 14 states have internal predecessors, (141), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:36:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:36:46,217 INFO L93 Difference]: Finished difference Result 330 states and 414 transitions. [2024-10-14 17:36:46,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:36:46,219 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.75) internal successors, (141), 14 states have internal predecessors, (141), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 151 [2024-10-14 17:36:46,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:36:46,221 INFO L225 Difference]: With dead ends: 330 [2024-10-14 17:36:46,221 INFO L226 Difference]: Without dead ends: 328 [2024-10-14 17:36:46,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:36:46,224 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 8 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1321 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:36:46,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1321 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 17:36:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-10-14 17:36:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 327. [2024-10-14 17:36:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 313 states have (on average 1.2268370607028753) internal successors, (384), 315 states have internal predecessors, (384), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 17:36:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 405 transitions. [2024-10-14 17:36:46,236 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 405 transitions. Word has length 151 [2024-10-14 17:36:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:36:46,237 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 405 transitions. [2024-10-14 17:36:46,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.75) internal successors, (141), 14 states have internal predecessors, (141), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:36:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 405 transitions. [2024-10-14 17:36:46,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-14 17:36:46,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:36:46,239 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:36:46,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:36:46,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:46,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:36:46,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:36:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -528146076, now seen corresponding path program 3 times [2024-10-14 17:36:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:36:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981379686] [2024-10-14 17:36:46,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:36:46,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:36:46,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:36:46,445 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:36:46,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 17:36:46,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:36:46,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:36:46,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:36:46,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:36:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-10-14 17:36:47,372 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:36:47,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:36:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981379686] [2024-10-14 17:36:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981379686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:36:47,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:36:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:36:47,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833122082] [2024-10-14 17:36:47,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:36:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:36:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:36:47,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:36:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:36:47,375 INFO L87 Difference]: Start difference. First operand 327 states and 405 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 17:36:51,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:55,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:36:57,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:37:02,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:37:06,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:37:13,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:37:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:37:13,678 INFO L93 Difference]: Finished difference Result 335 states and 413 transitions. [2024-10-14 17:37:13,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:37:13,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 169 [2024-10-14 17:37:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:37:13,680 INFO L225 Difference]: With dead ends: 335 [2024-10-14 17:37:13,680 INFO L226 Difference]: Without dead ends: 335 [2024-10-14 17:37:13,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:37:13,681 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 284 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:37:13,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 442 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 130 Invalid, 5 Unknown, 0 Unchecked, 26.3s Time] [2024-10-14 17:37:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-10-14 17:37:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 328. [2024-10-14 17:37:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 314 states have (on average 1.2229299363057324) internal successors, (384), 316 states have internal predecessors, (384), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 17:37:13,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 405 transitions. [2024-10-14 17:37:13,692 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 405 transitions. Word has length 169 [2024-10-14 17:37:13,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:37:13,693 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 405 transitions. [2024-10-14 17:37:13,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 17:37:13,693 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 405 transitions. [2024-10-14 17:37:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-14 17:37:13,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:37:13,695 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:37:13,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 17:37:13,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:37:13,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:37:13,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:37:13,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1501254283, now seen corresponding path program 1 times [2024-10-14 17:37:13,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:37:13,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947395466] [2024-10-14 17:37:13,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:37:13,898 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:37:13,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:37:13,901 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:37:13,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 17:37:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:37:14,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 17:37:14,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:37:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 260 proven. 55 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-10-14 17:37:14,887 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:37:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 1 proven. 311 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-10-14 17:37:15,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:37:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947395466] [2024-10-14 17:37:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947395466] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:37:15,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:37:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:37:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696415831] [2024-10-14 17:37:15,528 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:37:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:37:15,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:37:15,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:37:15,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:37:15,530 INFO L87 Difference]: Start difference. First operand 328 states and 405 transitions. Second operand has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:37:17,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:37:17,539 INFO L93 Difference]: Finished difference Result 349 states and 444 transitions. [2024-10-14 17:37:17,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:37:17,540 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2024-10-14 17:37:17,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:37:17,542 INFO L225 Difference]: With dead ends: 349 [2024-10-14 17:37:17,542 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 17:37:17,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:37:17,544 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 14 mSDsluCounter, 2629 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2852 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:37:17,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2852 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 17:37:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 17:37:17,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 346. [2024-10-14 17:37:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 332 states have (on average 1.2289156626506024) internal successors, (408), 334 states have internal predecessors, (408), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-14 17:37:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 429 transitions. [2024-10-14 17:37:17,553 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 429 transitions. Word has length 172 [2024-10-14 17:37:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:37:17,553 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 429 transitions. [2024-10-14 17:37:17,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.5) internal successors, (156), 26 states have internal predecessors, (156), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:37:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 429 transitions. [2024-10-14 17:37:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-14 17:37:17,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:37:17,556 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:37:17,576 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-10-14 17:37:17,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:37:17,757 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:37:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:37:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -220824203, now seen corresponding path program 2 times [2024-10-14 17:37:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:37:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632224870] [2024-10-14 17:37:17,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:37:17,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 17:37:17,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:37:17,760 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:37:17,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 17:37:18,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:37:18,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:37:18,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 1501 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 17:37:18,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:37:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 1088 proven. 253 refuted. 0 times theorem prover too weak. 1087 trivial. 0 not checked. [2024-10-14 17:37:19,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:37:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 1 proven. 1337 refuted. 0 times theorem prover too weak. 1090 trivial. 0 not checked. [2024-10-14 17:37:21,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:37:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632224870] [2024-10-14 17:37:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632224870] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:37:21,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:37:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:37:21,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390889082] [2024-10-14 17:37:21,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:37:21,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:37:21,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:37:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:37:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:37:21,136 INFO L87 Difference]: Start difference. First operand 346 states and 429 transitions. Second operand has 50 states, 48 states have (on average 3.75) internal successors, (180), 50 states have internal predecessors, (180), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)