./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_JEN_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:16:06,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:16:06,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:16:06,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:16:06,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:16:06,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:16:06,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:16:06,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:16:06,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:16:06,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:16:06,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:16:06,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:16:06,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:16:06,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:16:06,425 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:16:06,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:16:06,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:16:06,426 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:16:06,427 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:16:06,427 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:16:06,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:16:06,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:16:06,428 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:16:06,429 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:16:06,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:16:06,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:16:06,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:16:06,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:16:06,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:16:06,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:16:06,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:16:06,432 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:16:06,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:16:06,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:16:06,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:16:06,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:16:06,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:16:06,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:16:06,437 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:16:06,437 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:16:06,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:16:06,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:16:06,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:16:06,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:16:06,443 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:16:06,443 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2024-10-13 10:16:06,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:16:06,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:16:06,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:16:06,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:16:06,746 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:16:06,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-10-13 10:16:08,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:16:08,522 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:16:08,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-10-13 10:16:08,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ec0e81b/4849b06f07924d11af82186065991243/FLAG7e38a5ba3 [2024-10-13 10:16:08,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37ec0e81b/4849b06f07924d11af82186065991243 [2024-10-13 10:16:08,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:16:08,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:16:08,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:16:08,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:16:08,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:16:08,571 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:16:08" (1/1) ... [2024-10-13 10:16:08,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764fd7ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:08, skipping insertion in model container [2024-10-13 10:16:08,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:16:08" (1/1) ... [2024-10-13 10:16:08,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:16:09,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:16:09,229 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:16:09,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3faa2dc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:09, skipping insertion in model container [2024-10-13 10:16:09,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:16:09,231 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:16:09,233 INFO L158 Benchmark]: Toolchain (without parser) took 668.13ms. Allocated memory is still 138.4MB. Free memory was 83.7MB in the beginning and 61.0MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 10:16:09,234 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 138.4MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:16:09,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.72ms. Allocated memory is still 138.4MB. Free memory was 83.4MB in the beginning and 61.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 10:16:09,236 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.22ms. Allocated memory is still 138.4MB. Free memory is still 100.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.72ms. Allocated memory is still 138.4MB. Free memory was 83.4MB in the beginning and 61.0MB in the end (delta: 22.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_JEN_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 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:16:11,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:16:11,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:16:11,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:16:11,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:16:11,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:16:11,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:16:11,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:16:11,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:16:11,559 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:16:11,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:16:11,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:16:11,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:16:11,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:16:11,563 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:16:11,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:16:11,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:16:11,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:16:11,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:16:11,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:16:11,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:16:11,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:16:11,569 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:16:11,569 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:16:11,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:16:11,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:16:11,570 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:16:11,570 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:16:11,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:16:11,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:16:11,571 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:16:11,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:16:11,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:16:11,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:16:11,572 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:16:11,572 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:16:11,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:16:11,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:16:11,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:16:11,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:16:11,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:16:11,574 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:16:11,575 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:16:11,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:16:11,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:16:11,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:16:11,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:16:11,576 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:16:11,576 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 -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2024-10-13 10:16:11,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:16:11,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:16:11,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:16:11,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:16:11,925 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:16:11,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-10-13 10:16:13,517 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:16:13,836 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:16:13,836 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2024-10-13 10:16:13,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e58460b/358e52c178114105a196e7add13b2577/FLAGf26f8ab7f [2024-10-13 10:16:13,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83e58460b/358e52c178114105a196e7add13b2577 [2024-10-13 10:16:13,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:16:13,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:16:13,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:16:13,889 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:16:13,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:16:13,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:16:13" (1/1) ... [2024-10-13 10:16:13,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b78dc2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:13, skipping insertion in model container [2024-10-13 10:16:13,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:16:13" (1/1) ... [2024-10-13 10:16:13,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:16:14,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:16:14,554 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:16:14,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:16:14,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:16:14,677 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:16:14,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:16:14,824 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:16:14,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14 WrapperNode [2024-10-13 10:16:14,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:16:14,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:16:14,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:16:14,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:16:14,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:14,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:14,963 INFO L138 Inliner]: procedures = 179, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1172 [2024-10-13 10:16:14,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:16:14,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:16:14,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:16:14,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:16:14,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:14,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:14,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,100 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-13 10:16:15,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,164 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,174 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:16:15,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:16:15,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:16:15,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:16:15,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (1/1) ... [2024-10-13 10:16:15,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:16:15,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:16:15,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:16:15,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:16:15,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:16:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:16:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:16:15,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:16:15,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:16:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:16:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:16:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:16:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:16:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:16:15,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:16:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:16:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:16:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:16:15,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:16:15,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:16:15,475 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:16:15,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:16:31,172 INFO L? ?]: Removed 183 outVars from TransFormulas that were not future-live. [2024-10-13 10:16:31,173 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:16:31,212 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:16:31,212 INFO L314 CfgBuilder]: Removed 60 assume(true) statements. [2024-10-13 10:16:31,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:16:31 BoogieIcfgContainer [2024-10-13 10:16:31,212 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:16:31,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:16:31,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:16:31,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:16:31,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:16:13" (1/3) ... [2024-10-13 10:16:31,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715ebcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:16:31, skipping insertion in model container [2024-10-13 10:16:31,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:16:14" (2/3) ... [2024-10-13 10:16:31,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715ebcfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:16:31, skipping insertion in model container [2024-10-13 10:16:31,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:16:31" (3/3) ... [2024-10-13 10:16:31,225 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2024-10-13 10:16:31,242 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:16:31,243 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:16:31,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:16:31,301 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;@336b0811, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:16:31,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:16:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 192 states have (on average 1.6770833333333333) internal successors, (322), 204 states have internal predecessors, (322), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:16:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:16:31,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:31,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:16:31,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:31,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:31,319 INFO L85 PathProgramCache]: Analyzing trace with hash 930833829, now seen corresponding path program 1 times [2024-10-13 10:16:31,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:31,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465204762] [2024-10-13 10:16:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:31,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:31,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:31,330 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:31,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:16:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:31,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:16:31,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:16:31,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:31,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:31,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465204762] [2024-10-13 10:16:31,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465204762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:31,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:16:31,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322946878] [2024-10-13 10:16:31,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:31,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:16:31,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:16:31,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:16:31,541 INFO L87 Difference]: Start difference. First operand has 213 states, 192 states have (on average 1.6770833333333333) internal successors, (322), 204 states have internal predecessors, (322), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:31,593 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2024-10-13 10:16:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:16:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:16:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:31,606 INFO L225 Difference]: With dead ends: 212 [2024-10-13 10:16:31,607 INFO L226 Difference]: Without dead ends: 211 [2024-10-13 10:16:31,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:16:31,615 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:31,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:16:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-10-13 10:16:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2024-10-13 10:16:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 191 states have (on average 1.3141361256544504) internal successors, (251), 202 states have internal predecessors, (251), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:16:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 283 transitions. [2024-10-13 10:16:31,740 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 283 transitions. Word has length 6 [2024-10-13 10:16:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:31,740 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 283 transitions. [2024-10-13 10:16:31,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 283 transitions. [2024-10-13 10:16:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:16:31,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:31,741 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:16:31,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:16:31,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:31,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:31,943 INFO L85 PathProgramCache]: Analyzing trace with hash 270449044, now seen corresponding path program 1 times [2024-10-13 10:16:31,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:31,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1680089627] [2024-10-13 10:16:31,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:31,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:31,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:31,947 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:31,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:16:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:32,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 10:16:32,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:16:32,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:32,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1680089627] [2024-10-13 10:16:32,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1680089627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:32,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:16:32,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068459114] [2024-10-13 10:16:32,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:32,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:16:32,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:16:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:16:32,098 INFO L87 Difference]: Start difference. First operand 211 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:32,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:32,316 INFO L93 Difference]: Finished difference Result 385 states and 509 transitions. [2024-10-13 10:16:32,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:16:32,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-13 10:16:32,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:32,321 INFO L225 Difference]: With dead ends: 385 [2024-10-13 10:16:32,321 INFO L226 Difference]: Without dead ends: 385 [2024-10-13 10:16:32,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:16:32,324 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 213 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:32,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 580 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:16:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-13 10:16:32,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 212. [2024-10-13 10:16:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 192 states have (on average 1.3125) internal successors, (252), 203 states have internal predecessors, (252), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:16:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 284 transitions. [2024-10-13 10:16:32,355 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 284 transitions. Word has length 6 [2024-10-13 10:16:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:32,355 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 284 transitions. [2024-10-13 10:16:32,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:32,356 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 284 transitions. [2024-10-13 10:16:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 10:16:32,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:32,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:16:32,364 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-13 10:16:32,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:32,563 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:32,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1848851602, now seen corresponding path program 1 times [2024-10-13 10:16:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:32,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [539709550] [2024-10-13 10:16:32,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:32,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:32,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:32,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:32,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:16:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:33,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:16:33,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:16:33,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:33,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:33,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [539709550] [2024-10-13 10:16:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [539709550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:33,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:33,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:16:33,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183203136] [2024-10-13 10:16:33,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:33,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:16:33,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:33,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:16:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:16:33,282 INFO L87 Difference]: Start difference. First operand 212 states and 284 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:33,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:33,452 INFO L93 Difference]: Finished difference Result 215 states and 279 transitions. [2024-10-13 10:16:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:16:33,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2024-10-13 10:16:33,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:33,457 INFO L225 Difference]: With dead ends: 215 [2024-10-13 10:16:33,457 INFO L226 Difference]: Without dead ends: 215 [2024-10-13 10:16:33,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:16:33,458 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:33,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 733 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:16:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-13 10:16:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2024-10-13 10:16:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 195 states have (on average 1.2666666666666666) internal successors, (247), 206 states have internal predecessors, (247), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:16:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 279 transitions. [2024-10-13 10:16:33,486 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 279 transitions. Word has length 112 [2024-10-13 10:16:33,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:33,486 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 279 transitions. [2024-10-13 10:16:33,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:33,487 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 279 transitions. [2024-10-13 10:16:33,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 10:16:33,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:33,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:16:33,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:16:33,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:33,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:33,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1336085638, now seen corresponding path program 1 times [2024-10-13 10:16:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:33,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672910665] [2024-10-13 10:16:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:33,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:33,705 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:33,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:16:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:34,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:16:34,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:16:34,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:34,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:34,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672910665] [2024-10-13 10:16:34,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672910665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:34,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:34,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:16:34,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789269360] [2024-10-13 10:16:34,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:34,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:16:34,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:34,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:16:34,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:16:34,424 INFO L87 Difference]: Start difference. First operand 215 states and 279 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:34,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:34,532 INFO L93 Difference]: Finished difference Result 209 states and 269 transitions. [2024-10-13 10:16:34,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:16:34,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 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 112 [2024-10-13 10:16:34,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:34,535 INFO L225 Difference]: With dead ends: 209 [2024-10-13 10:16:34,535 INFO L226 Difference]: Without dead ends: 209 [2024-10-13 10:16:34,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 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-13 10:16:34,536 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:34,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 730 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:16:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-13 10:16:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-13 10:16:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 189 states have (on average 1.253968253968254) internal successors, (237), 200 states have internal predecessors, (237), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:16:34,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 269 transitions. [2024-10-13 10:16:34,556 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 269 transitions. Word has length 112 [2024-10-13 10:16:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:34,556 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 269 transitions. [2024-10-13 10:16:34,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 269 transitions. [2024-10-13 10:16:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 10:16:34,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:34,560 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:16:34,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:16:34,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:34,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:34,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:34,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1634025464, now seen corresponding path program 1 times [2024-10-13 10:16:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:34,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240124182] [2024-10-13 10:16:34,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:34,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:34,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:34,766 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:34,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:16:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:35,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:16:35,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:35,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:16:35,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:35,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:35,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240124182] [2024-10-13 10:16:35,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240124182] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:35,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:35,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:16:35,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797601826] [2024-10-13 10:16:35,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:35,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:16:35,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:35,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:16:35,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:16:35,678 INFO L87 Difference]: Start difference. First operand 209 states and 269 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:36,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:36,361 INFO L93 Difference]: Finished difference Result 245 states and 305 transitions. [2024-10-13 10:16:36,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:16:36,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 112 [2024-10-13 10:16:36,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:36,368 INFO L225 Difference]: With dead ends: 245 [2024-10-13 10:16:36,368 INFO L226 Difference]: Without dead ends: 245 [2024-10-13 10:16:36,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:16:36,370 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 522 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.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:36,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 522 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:16:36,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-13 10:16:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-13 10:16:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 225 states have (on average 1.2133333333333334) internal successors, (273), 236 states have internal predecessors, (273), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 10:16:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 305 transitions. [2024-10-13 10:16:36,379 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 305 transitions. Word has length 112 [2024-10-13 10:16:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:36,379 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 305 transitions. [2024-10-13 10:16:36,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:16:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 305 transitions. [2024-10-13 10:16:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-13 10:16:36,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:36,382 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] [2024-10-13 10:16:36,399 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-13 10:16:36,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:36,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:36,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1600948529, now seen corresponding path program 1 times [2024-10-13 10:16:36,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:36,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621732518] [2024-10-13 10:16:36,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:36,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:36,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:36,586 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:36,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:16:37,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:37,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 645 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:16:37,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:16:37,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:37,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:37,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621732518] [2024-10-13 10:16:37,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621732518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:37,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:37,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:16:37,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058950663] [2024-10-13 10:16:37,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:37,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:16:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:37,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:16:37,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:16:37,212 INFO L87 Difference]: Start difference. First operand 245 states and 305 transitions. Second operand has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:16:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:37,298 INFO L93 Difference]: Finished difference Result 247 states and 309 transitions. [2024-10-13 10:16:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:16:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2024-10-13 10:16:37,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:37,301 INFO L225 Difference]: With dead ends: 247 [2024-10-13 10:16:37,302 INFO L226 Difference]: Without dead ends: 247 [2024-10-13 10:16:37,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:16:37,304 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 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-13 10:16:37,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:16:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-13 10:16:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2024-10-13 10:16:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 226 states have (on average 1.2168141592920354) internal successors, (275), 238 states have internal predecessors, (275), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 309 transitions. [2024-10-13 10:16:37,316 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 309 transitions. Word has length 125 [2024-10-13 10:16:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:37,317 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 309 transitions. [2024-10-13 10:16:37,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 40.333333333333336) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:16:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 309 transitions. [2024-10-13 10:16:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-13 10:16:37,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:37,319 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:16:37,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:16:37,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:37,520 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:37,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:37,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1857742555, now seen corresponding path program 1 times [2024-10-13 10:16:37,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:37,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008589507] [2024-10-13 10:16:37,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:37,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:37,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:37,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:16:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:38,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:16:38,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:38,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 10:16:38,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:16:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 10:16:38,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008589507] [2024-10-13 10:16:38,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008589507] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:16:38,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:16:38,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:16:38,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693376615] [2024-10-13 10:16:38,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:16:38,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:16:38,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:38,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:16:38,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:16:38,306 INFO L87 Difference]: Start difference. First operand 247 states and 309 transitions. Second operand has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:38,594 INFO L93 Difference]: Finished difference Result 256 states and 324 transitions. [2024-10-13 10:16:38,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:16:38,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 127 [2024-10-13 10:16:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:38,597 INFO L225 Difference]: With dead ends: 256 [2024-10-13 10:16:38,597 INFO L226 Difference]: Without dead ends: 256 [2024-10-13 10:16:38,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:16:38,598 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 5 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:38,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1032 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:16:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-13 10:16:38,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2024-10-13 10:16:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 233 states have (on average 1.2360515021459229) internal successors, (288), 245 states have internal predecessors, (288), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 322 transitions. [2024-10-13 10:16:38,606 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 322 transitions. Word has length 127 [2024-10-13 10:16:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:38,607 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 322 transitions. [2024-10-13 10:16:38,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:38,607 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 322 transitions. [2024-10-13 10:16:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-13 10:16:38,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:38,611 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-10-13 10:16:38,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-13 10:16:38,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:38,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:38,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:38,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1505795791, now seen corresponding path program 2 times [2024-10-13 10:16:38,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:38,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908502113] [2024-10-13 10:16:38,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:16:38,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:38,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:38,816 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:38,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:16:39,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:16:39,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:16:39,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:16:39,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:16:39,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:16:39,813 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:16:39,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:39,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908502113] [2024-10-13 10:16:39,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908502113] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:16:39,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:16:39,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:16:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440449766] [2024-10-13 10:16:39,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:16:39,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:16:39,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:16:39,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:16:39,817 INFO L87 Difference]: Start difference. First operand 255 states and 322 transitions. Second operand has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:40,717 INFO L93 Difference]: Finished difference Result 267 states and 342 transitions. [2024-10-13 10:16:40,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:16:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 131 [2024-10-13 10:16:40,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:40,720 INFO L225 Difference]: With dead ends: 267 [2024-10-13 10:16:40,720 INFO L226 Difference]: Without dead ends: 265 [2024-10-13 10:16:40,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:16:40,721 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 7 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1804 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:40,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1804 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:16:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-13 10:16:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 264. [2024-10-13 10:16:40,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 242 states have (on average 1.2396694214876034) internal successors, (300), 254 states have internal predecessors, (300), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 334 transitions. [2024-10-13 10:16:40,737 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 334 transitions. Word has length 131 [2024-10-13 10:16:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:40,737 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 334 transitions. [2024-10-13 10:16:40,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 11.25) internal successors, (135), 14 states have internal predecessors, (135), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 334 transitions. [2024-10-13 10:16:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 10:16:40,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:40,740 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-13 10:16:40,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:16:40,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:40,941 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:40,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1068976461, now seen corresponding path program 3 times [2024-10-13 10:16:40,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:40,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51896657] [2024-10-13 10:16:40,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:16:40,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:40,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:40,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:40,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:16:41,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:16:41,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:16:41,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:16:41,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:41,534 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2024-10-13 10:16:41,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:41,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:41,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51896657] [2024-10-13 10:16:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51896657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:16:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351461845] [2024-10-13 10:16:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:16:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:16:41,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:16:41,538 INFO L87 Difference]: Start difference. First operand 264 states and 334 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-13 10:16:41,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:41,690 INFO L93 Difference]: Finished difference Result 267 states and 329 transitions. [2024-10-13 10:16:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:16:41,691 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 140 [2024-10-13 10:16:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:41,693 INFO L225 Difference]: With dead ends: 267 [2024-10-13 10:16:41,693 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 10:16:41,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:16:41,694 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:41,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 688 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:16:41,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 10:16:41,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-10-13 10:16:41,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 245 states have (on average 1.2040816326530612) internal successors, (295), 257 states have internal predecessors, (295), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:41,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 329 transitions. [2024-10-13 10:16:41,703 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 329 transitions. Word has length 140 [2024-10-13 10:16:41,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:41,703 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 329 transitions. [2024-10-13 10:16:41,703 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-13 10:16:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 329 transitions. [2024-10-13 10:16:41,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 10:16:41,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:41,705 INFO L215 NwaCegarLoop]: trace histogram [15, 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] [2024-10-13 10:16:41,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:16:41,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:41,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:41,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:41,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1163749671, now seen corresponding path program 1 times [2024-10-13 10:16:41,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:41,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734921911] [2024-10-13 10:16:41,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:41,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:41,909 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:41,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:16:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:42,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:16:42,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:42,795 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 69 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-13 10:16:42,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:16:43,673 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 1 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 10:16:43,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:43,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734921911] [2024-10-13 10:16:43,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734921911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:16:43,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:16:43,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:16:43,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115947469] [2024-10-13 10:16:43,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:16:43,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:16:43,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:43,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:16:43,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:16:43,676 INFO L87 Difference]: Start difference. First operand 267 states and 329 transitions. Second operand has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:45,948 INFO L93 Difference]: Finished difference Result 288 states and 367 transitions. [2024-10-13 10:16:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:16:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 140 [2024-10-13 10:16:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:45,950 INFO L225 Difference]: With dead ends: 288 [2024-10-13 10:16:45,950 INFO L226 Difference]: Without dead ends: 286 [2024-10-13 10:16:45,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:16:45,951 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 14 mSDsluCounter, 2953 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3203 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:45,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3203 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:16:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-13 10:16:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2024-10-13 10:16:45,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 263 states have (on average 1.2129277566539924) internal successors, (319), 275 states have internal predecessors, (319), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 353 transitions. [2024-10-13 10:16:45,963 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 353 transitions. Word has length 140 [2024-10-13 10:16:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:45,964 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 353 transitions. [2024-10-13 10:16:45,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.125) internal successors, (147), 26 states have internal predecessors, (147), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 353 transitions. [2024-10-13 10:16:45,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-13 10:16:45,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:45,966 INFO L215 NwaCegarLoop]: trace histogram [33, 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] [2024-10-13 10:16:45,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 10:16:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:46,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:46,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash -580157145, now seen corresponding path program 2 times [2024-10-13 10:16:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:46,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153821449] [2024-10-13 10:16:46,168 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:16:46,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:46,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:46,170 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:46,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:16:46,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:16:46,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:16:46,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:16:46,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 279 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-13 10:16:47,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:16:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-13 10:16:49,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:49,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153821449] [2024-10-13 10:16:49,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153821449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:16:49,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:16:49,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:16:49,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377214945] [2024-10-13 10:16:49,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:16:49,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:16:49,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:49,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:16:49,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:16:49,222 INFO L87 Difference]: Start difference. First operand 285 states and 353 transitions. Second operand has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:56,100 INFO L93 Difference]: Finished difference Result 322 states and 423 transitions. [2024-10-13 10:16:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:16:56,100 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 158 [2024-10-13 10:16:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:56,102 INFO L225 Difference]: With dead ends: 322 [2024-10-13 10:16:56,102 INFO L226 Difference]: Without dead ends: 320 [2024-10-13 10:16:56,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:16:56,105 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 25 mSDsluCounter, 6146 mSDsCounter, 0 mSdLazyCounter, 2046 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6396 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:56,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6396 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2046 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 10:16:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-13 10:16:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 319. [2024-10-13 10:16:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 297 states have (on average 1.228956228956229) internal successors, (365), 309 states have internal predecessors, (365), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 399 transitions. [2024-10-13 10:16:56,113 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 399 transitions. Word has length 158 [2024-10-13 10:16:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:56,114 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 399 transitions. [2024-10-13 10:16:56,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5625) internal successors, (171), 50 states have internal predecessors, (171), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:16:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 399 transitions. [2024-10-13 10:16:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 10:16:56,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:56,116 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-13 10:16:56,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-13 10:16:56,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:56,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:56,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1005849319, now seen corresponding path program 3 times [2024-10-13 10:16:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:56,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205456697] [2024-10-13 10:16:56,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 10:16:56,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:56,319 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:56,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:16:56,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 10:16:56,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:16:56,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:16:56,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-10-13 10:16:57,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:16:57,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:16:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205456697] [2024-10-13 10:16:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205456697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:16:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:16:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:16:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624188512] [2024-10-13 10:16:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:16:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:16:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:16:57,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:16:57,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:16:57,078 INFO L87 Difference]: Start difference. First operand 319 states and 399 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-13 10:16:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:16:57,169 INFO L93 Difference]: Finished difference Result 313 states and 389 transitions. [2024-10-13 10:16:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:16:57,170 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 192 [2024-10-13 10:16:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:16:57,174 INFO L225 Difference]: With dead ends: 313 [2024-10-13 10:16:57,174 INFO L226 Difference]: Without dead ends: 313 [2024-10-13 10:16:57,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-13 10:16:57,175 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:16:57,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:16:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-13 10:16:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-10-13 10:16:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 291 states have (on average 1.2199312714776633) internal successors, (355), 303 states have internal predecessors, (355), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:16:57,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 389 transitions. [2024-10-13 10:16:57,185 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 389 transitions. Word has length 192 [2024-10-13 10:16:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:16:57,185 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 389 transitions. [2024-10-13 10:16:57,185 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-13 10:16:57,185 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 389 transitions. [2024-10-13 10:16:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 10:16:57,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:16:57,187 INFO L215 NwaCegarLoop]: trace histogram [67, 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] [2024-10-13 10:16:57,201 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 (13)] Forceful destruction successful, exit code 0 [2024-10-13 10:16:57,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:57,389 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:16:57,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:16:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash 731089705, now seen corresponding path program 1 times [2024-10-13 10:16:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:16:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403965130] [2024-10-13 10:16:57,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:16:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:16:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:16:57,394 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:16:57,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:16:58,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:16:58,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:16:58,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:16:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:16:59,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:17:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:17:01,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:17:01,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403965130] [2024-10-13 10:17:01,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403965130] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:17:01,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:17:01,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:17:01,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556780392] [2024-10-13 10:17:01,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:17:01,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:17:01,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:17:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:17:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:17:01,519 INFO L87 Difference]: Start difference. First operand 313 states and 389 transitions. Second operand has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:17:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:17:10,340 INFO L93 Difference]: Finished difference Result 340 states and 443 transitions. [2024-10-13 10:17:10,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:17:10,340 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 192 [2024-10-13 10:17:10,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:17:10,342 INFO L225 Difference]: With dead ends: 340 [2024-10-13 10:17:10,342 INFO L226 Difference]: Without dead ends: 340 [2024-10-13 10:17:10,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:17:10,347 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 27 mSDsluCounter, 6004 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6249 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-13 10:17:10,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6249 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-13 10:17:10,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-13 10:17:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2024-10-13 10:17:10,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 316 states have (on average 1.2816455696202531) internal successors, (405), 328 states have internal predecessors, (405), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-10-13 10:17:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 439 transitions. [2024-10-13 10:17:10,357 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 439 transitions. Word has length 192 [2024-10-13 10:17:10,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:17:10,357 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 439 transitions. [2024-10-13 10:17:10,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.4) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:17:10,358 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 439 transitions. [2024-10-13 10:17:10,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-13 10:17:10,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:17:10,360 INFO L215 NwaCegarLoop]: trace histogram [92, 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] [2024-10-13 10:17:10,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-13 10:17:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:17:10,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:17:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:17:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 635431941, now seen corresponding path program 2 times [2024-10-13 10:17:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:17:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452342922] [2024-10-13 10:17:10,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:17:10,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:17:10,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:17:10,564 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:17:10,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:17:12,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:17:12,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:17:12,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 1647 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:17:12,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:17:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:17:14,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:17:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-13 10:17:22,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:17:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452342922] [2024-10-13 10:17:22,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452342922] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:17:22,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:17:22,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:17:22,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535200232] [2024-10-13 10:17:22,901 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:17:22,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:17:22,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:17:22,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:17:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:17:22,906 INFO L87 Difference]: Start difference. First operand 338 states and 439 transitions. Second operand has 102 states, 100 states have (on average 2.2) internal successors, (220), 102 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)