./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_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4a390ef5 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_BER_test6-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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:45:47,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:45:47,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:45:47,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:45:47,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:45:47,262 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:45:47,262 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:45:47,263 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:45:47,263 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:45:47,265 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:45:47,265 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:45:47,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:45:47,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:45:47,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:45:47,267 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:45:47,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:45:47,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:45:47,268 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:45:47,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:45:47,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:45:47,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:45:47,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:45:47,270 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:45:47,270 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:45:47,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:45:47,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:45:47,272 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:45:47,272 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:45:47,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:45:47,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:45:47,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:45:47,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:45:47,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:45:47,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:45:47,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:45:47,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:45:47,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:45:47,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:45:47,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:45:47,276 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-10-24 15:45:47,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:45:47,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:45:47,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:45:47,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:45:47,565 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:45:47,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-24 15:45:48,853 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:45:49,038 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:45:49,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-24 15:45:49,080 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68545ea62/95fb36d0711d4ac1837d3ee3ec653d8e/FLAGd9314bbce [2024-10-24 15:45:49,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68545ea62/95fb36d0711d4ac1837d3ee3ec653d8e [2024-10-24 15:45:49,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:45:49,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:45:49,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:49,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:45:49,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:45:49,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:49" (1/1) ... [2024-10-24 15:45:49,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@145046bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:49, skipping insertion in model container [2024-10-24 15:45:49,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:49" (1/1) ... [2024-10-24 15:45:49,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:45:49,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:49,681 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-24 15:45:49,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@66d17ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:49, skipping insertion in model container [2024-10-24 15:45:49,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:49,682 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:45:49,683 INFO L158 Benchmark]: Toolchain (without parser) took 586.30ms. Allocated memory is still 134.2MB. Free memory was 106.8MB in the beginning and 82.1MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 15:45:49,683 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 134.2MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:45:49,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.51ms. Allocated memory is still 134.2MB. Free memory was 106.3MB in the beginning and 82.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-24 15:45:49,685 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 134.2MB. Free memory is still 107.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.51ms. Allocated memory is still 134.2MB. Free memory was 106.3MB in the beginning and 82.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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_BER_test6-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 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:45:51,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:45:51,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:45:51,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:45:51,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:45:51,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:45:51,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:45:51,549 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:45:51,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:45:51,551 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:45:51,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:45:51,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:45:51,553 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:45:51,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:45:51,553 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:45:51,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:45:51,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:45:51,557 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:45:51,557 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:45:51,557 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:45:51,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:45:51,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:45:51,558 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:45:51,558 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:45:51,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:45:51,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:45:51,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:45:51,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:45:51,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:45:51,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:45:51,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:45:51,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:45:51,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:45:51,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:45:51,561 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:45:51,561 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:45:51,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:45:51,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:45:51,562 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:45:51,562 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:45:51,562 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:45:51,562 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:45:51,562 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 -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-10-24 15:45:51,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:45:51,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:45:51,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:45:51,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:45:51,899 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:45:51,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-24 15:45:53,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:45:53,740 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:45:53,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-24 15:45:53,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c08ff85e/13d54b4c028046f8a69ce3632638ef49/FLAGefa0baff3 [2024-10-24 15:45:54,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c08ff85e/13d54b4c028046f8a69ce3632638ef49 [2024-10-24 15:45:54,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:45:54,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:45:54,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:54,039 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:45:54,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:45:54,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:54,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eb80f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54, skipping insertion in model container [2024-10-24 15:45:54,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:54,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:45:54,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:54,663 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:45:54,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:45:54,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:54,781 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:45:54,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:45:54,908 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:45:54,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54 WrapperNode [2024-10-24 15:45:54,909 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:45:54,910 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:45:54,910 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:45:54,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:45:54,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:54,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,015 INFO L138 Inliner]: procedures = 285, calls = 290, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1062 [2024-10-24 15:45:55,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:45:55,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:45:55,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:45:55,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:45:55,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,111 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 34, 3, 220]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 4, 2, 49]. [2024-10-24 15:45:55,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:45:55,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:45:55,203 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:45:55,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:45:55,204 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (1/1) ... [2024-10-24 15:45:55,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:45:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:45:55,243 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-24 15:45:55,252 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-24 15:45:55,289 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:45:55,289 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:45:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:45:55,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-24 15:45:55,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:45:55,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:45:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-24 15:45:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:45:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:45:55,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-24 15:45:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:45:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-24 15:45:55,294 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-24 15:45:55,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:45:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:45:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:45:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-24 15:45:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-24 15:45:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-24 15:45:55,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:45:55,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:45:55,532 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:45:55,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:46:01,784 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-24 15:46:01,784 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:46:01,816 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:46:01,816 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-24 15:46:01,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:46:01 BoogieIcfgContainer [2024-10-24 15:46:01,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:46:01,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:46:01,819 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:46:01,821 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:46:01,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:45:54" (1/3) ... [2024-10-24 15:46:01,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8de5812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:46:01, skipping insertion in model container [2024-10-24 15:46:01,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:45:54" (2/3) ... [2024-10-24 15:46:01,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8de5812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:46:01, skipping insertion in model container [2024-10-24 15:46:01,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:46:01" (3/3) ... [2024-10-24 15:46:01,824 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2024-10-24 15:46:01,836 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:46:01,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:46:01,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:46:01,882 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;@4226be6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:46:01,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:46:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 200 states have (on average 1.635) internal successors, (327), 205 states have internal predecessors, (327), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 15:46:01,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 15:46:01,892 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:01,892 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:01,893 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:01,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:01,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1518545934, now seen corresponding path program 1 times [2024-10-24 15:46:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197387060] [2024-10-24 15:46:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:01,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-24 15:46:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:01,909 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-24 15:46:01,911 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-24 15:46:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:02,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:46:02,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:02,083 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-24 15:46:02,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:02,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197387060] [2024-10-24 15:46:02,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197387060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:02,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:02,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:46:02,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923770699] [2024-10-24 15:46:02,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:02,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:46:02,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:46:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:46:02,121 INFO L87 Difference]: Start difference. First operand has 225 states, 200 states have (on average 1.635) internal successors, (327), 205 states have internal predecessors, (327), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:02,183 INFO L93 Difference]: Finished difference Result 220 states and 285 transitions. [2024-10-24 15:46:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:46:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-24 15:46:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:02,192 INFO L225 Difference]: With dead ends: 220 [2024-10-24 15:46:02,193 INFO L226 Difference]: Without dead ends: 219 [2024-10-24 15:46:02,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-24 15:46:02,197 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:02,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:46:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-24 15:46:02,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-24 15:46:02,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 196 states have (on average 1.2959183673469388) internal successors, (254), 201 states have internal predecessors, (254), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:46:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 284 transitions. [2024-10-24 15:46:02,303 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 284 transitions. Word has length 9 [2024-10-24 15:46:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 284 transitions. [2024-10-24 15:46:02,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 284 transitions. [2024-10-24 15:46:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 15:46:02,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:02,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:02,310 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-24 15:46:02,506 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-24 15:46:02,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:02,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1131489963, now seen corresponding path program 1 times [2024-10-24 15:46:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:02,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464157339] [2024-10-24 15:46:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:02,509 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-24 15:46:02,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:02,512 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-24 15:46:02,513 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-24 15:46:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:02,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:02,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:02,707 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-24 15:46:02,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:02,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:02,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464157339] [2024-10-24 15:46:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464157339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:02,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:02,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:46:02,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518962628] [2024-10-24 15:46:02,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:02,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:02,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:02,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:02,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:02,710 INFO L87 Difference]: Start difference. First operand 219 states and 284 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:06,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:46:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:08,528 INFO L93 Difference]: Finished difference Result 333 states and 434 transitions. [2024-10-24 15:46:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 15:46:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:08,535 INFO L225 Difference]: With dead ends: 333 [2024-10-24 15:46:08,535 INFO L226 Difference]: Without dead ends: 333 [2024-10-24 15:46:08,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-24 15:46:08,541 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 137 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:08,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 749 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-10-24 15:46:08,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-24 15:46:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 329. [2024-10-24 15:46:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.303921568627451) internal successors, (399), 311 states have internal predecessors, (399), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:46:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 429 transitions. [2024-10-24 15:46:08,573 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 429 transitions. Word has length 11 [2024-10-24 15:46:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:08,573 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 429 transitions. [2024-10-24 15:46:08,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:08,573 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 429 transitions. [2024-10-24 15:46:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-24 15:46:08,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:08,578 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:08,582 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-24 15:46:08,778 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-24 15:46:08,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2059992344, now seen corresponding path program 1 times [2024-10-24 15:46:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1409979111] [2024-10-24 15:46:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:08,780 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-24 15:46:08,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:08,784 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-24 15:46:08,784 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-24 15:46:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:09,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:46:09,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:09,084 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:09,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:09,085 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:09,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:46:09,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:46:09,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:46:09,165 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-24 15:46:09,167 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:09,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:09,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1409979111] [2024-10-24 15:46:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1409979111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:09,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:09,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:46:09,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672782580] [2024-10-24 15:46:09,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:09,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:09,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:09,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:09,170 INFO L87 Difference]: Start difference. First operand 329 states and 429 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:09,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:09,616 INFO L93 Difference]: Finished difference Result 506 states and 666 transitions. [2024-10-24 15:46:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-24 15:46:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:09,618 INFO L225 Difference]: With dead ends: 506 [2024-10-24 15:46:09,618 INFO L226 Difference]: Without dead ends: 506 [2024-10-24 15:46:09,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-24 15:46:09,619 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 227 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:09,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 828 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 15:46:09,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-24 15:46:09,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 328. [2024-10-24 15:46:09,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 305 states have (on average 1.301639344262295) internal successors, (397), 310 states have internal predecessors, (397), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:46:09,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 427 transitions. [2024-10-24 15:46:09,633 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 427 transitions. Word has length 14 [2024-10-24 15:46:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:09,633 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 427 transitions. [2024-10-24 15:46:09,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:09,634 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 427 transitions. [2024-10-24 15:46:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 15:46:09,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:09,635 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] [2024-10-24 15:46:09,643 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-24 15:46:09,838 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-24 15:46:09,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:09,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 518278030, now seen corresponding path program 1 times [2024-10-24 15:46:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:09,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662072743] [2024-10-24 15:46:09,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:09,841 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-24 15:46:09,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:09,846 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-24 15:46:09,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 15:46:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:10,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:46:10,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:10,095 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-24 15:46:10,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:10,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662072743] [2024-10-24 15:46:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662072743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:10,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:10,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:46:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364756725] [2024-10-24 15:46:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:10,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:10,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:10,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:10,099 INFO L87 Difference]: Start difference. First operand 328 states and 427 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:10,204 INFO L93 Difference]: Finished difference Result 334 states and 417 transitions. [2024-10-24 15:46:10,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:46:10,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-24 15:46:10,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:10,206 INFO L225 Difference]: With dead ends: 334 [2024-10-24 15:46:10,206 INFO L226 Difference]: Without dead ends: 334 [2024-10-24 15:46:10,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-24 15:46:10,207 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 30 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:10,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 724 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:46:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-24 15:46:10,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-10-24 15:46:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 311 states have (on average 1.2443729903536977) internal successors, (387), 316 states have internal predecessors, (387), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 15:46:10,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 417 transitions. [2024-10-24 15:46:10,215 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 417 transitions. Word has length 48 [2024-10-24 15:46:10,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:10,215 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 417 transitions. [2024-10-24 15:46:10,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 417 transitions. [2024-10-24 15:46:10,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-24 15:46:10,216 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:10,216 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] [2024-10-24 15:46:10,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:10,416 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-24 15:46:10,417 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:10,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:10,419 INFO L85 PathProgramCache]: Analyzing trace with hash 972862082, now seen corresponding path program 1 times [2024-10-24 15:46:10,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733082828] [2024-10-24 15:46:10,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:10,420 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-24 15:46:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:10,421 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-24 15:46:10,423 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-24 15:46:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:10,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:10,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:10,695 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-24 15:46:10,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:10,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733082828] [2024-10-24 15:46:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733082828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:10,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:10,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 15:46:10,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843313262] [2024-10-24 15:46:10,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:10,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:46:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:10,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:46:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:46:10,697 INFO L87 Difference]: Start difference. First operand 334 states and 417 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:10,853 INFO L93 Difference]: Finished difference Result 343 states and 426 transitions. [2024-10-24 15:46:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 15:46:10,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-10-24 15:46:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:10,855 INFO L225 Difference]: With dead ends: 343 [2024-10-24 15:46:10,855 INFO L226 Difference]: Without dead ends: 343 [2024-10-24 15:46:10,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:46:10,856 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 8 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:10,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1300 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:46:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-24 15:46:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2024-10-24 15:46:10,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 317 states have (on average 1.2429022082018928) internal successors, (394), 323 states have internal predecessors, (394), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-24 15:46:10,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 426 transitions. [2024-10-24 15:46:10,864 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 426 transitions. Word has length 48 [2024-10-24 15:46:10,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:10,865 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 426 transitions. [2024-10-24 15:46:10,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:46:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 426 transitions. [2024-10-24 15:46:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-24 15:46:10,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:10,866 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-24 15:46:10,874 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-24 15:46:11,067 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-24 15:46:11,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:11,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1058188914, now seen corresponding path program 1 times [2024-10-24 15:46:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010454895] [2024-10-24 15:46:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:11,068 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-24 15:46:11,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:11,071 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-24 15:46:11,072 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-24 15:46:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:11,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:11,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:11,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:11,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:11,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010454895] [2024-10-24 15:46:11,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2010454895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:11,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:11,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 15:46:11,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724143509] [2024-10-24 15:46:11,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:11,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 15:46:11,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:11,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 15:46:11,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 15:46:11,469 INFO L87 Difference]: Start difference. First operand 343 states and 426 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:46:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:11,681 INFO L93 Difference]: Finished difference Result 349 states and 434 transitions. [2024-10-24 15:46:11,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 15:46:11,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2024-10-24 15:46:11,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:11,684 INFO L225 Difference]: With dead ends: 349 [2024-10-24 15:46:11,684 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 15:46:11,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 15:46:11,685 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 17 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:11,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 946 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 15:46:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 15:46:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2024-10-24 15:46:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 318 states have (on average 1.2421383647798743) internal successors, (395), 325 states have internal predecessors, (395), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2024-10-24 15:46:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 430 transitions. [2024-10-24 15:46:11,693 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 430 transitions. Word has length 60 [2024-10-24 15:46:11,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:11,693 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 430 transitions. [2024-10-24 15:46:11,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:46:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 430 transitions. [2024-10-24 15:46:11,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 15:46:11,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:11,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:11,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 15:46:11,898 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-24 15:46:11,899 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:11,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:11,899 INFO L85 PathProgramCache]: Analyzing trace with hash -356355389, now seen corresponding path program 1 times [2024-10-24 15:46:11,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:11,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805377368] [2024-10-24 15:46:11,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:11,900 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-24 15:46:11,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:11,903 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-24 15:46:11,903 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-24 15:46:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:12,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:46:12,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:12,258 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:12,258 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805377368] [2024-10-24 15:46:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805377368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:12,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:46:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509036975] [2024-10-24 15:46:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:12,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:12,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:12,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:12,260 INFO L87 Difference]: Start difference. First operand 346 states and 430 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:46:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:12,336 INFO L93 Difference]: Finished difference Result 348 states and 433 transitions. [2024-10-24 15:46:12,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2024-10-24 15:46:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:12,340 INFO L225 Difference]: With dead ends: 348 [2024-10-24 15:46:12,340 INFO L226 Difference]: Without dead ends: 348 [2024-10-24 15:46:12,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 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-24 15:46:12,341 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:12,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 784 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:46:12,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-10-24 15:46:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-10-24 15:46:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 319 states have (on average 1.244514106583072) internal successors, (397), 327 states have internal predecessors, (397), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-24 15:46:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 433 transitions. [2024-10-24 15:46:12,353 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 433 transitions. Word has length 65 [2024-10-24 15:46:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:12,354 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 433 transitions. [2024-10-24 15:46:12,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:46:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 433 transitions. [2024-10-24 15:46:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-24 15:46:12,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:12,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:12,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 15:46:12,555 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-24 15:46:12,556 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1848689150, now seen corresponding path program 1 times [2024-10-24 15:46:12,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409475970] [2024-10-24 15:46:12,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:12,558 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-24 15:46:12,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:12,560 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-24 15:46:12,562 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-24 15:46:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:12,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:46:12,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:12,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:12,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409475970] [2024-10-24 15:46:12,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409475970] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:12,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:12,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:46:12,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477183041] [2024-10-24 15:46:12,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:12,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:46:12,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:12,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:46:12,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:46:12,952 INFO L87 Difference]: Start difference. First operand 348 states and 433 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:13,117 INFO L93 Difference]: Finished difference Result 357 states and 447 transitions. [2024-10-24 15:46:13,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:46:13,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-10-24 15:46:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:13,120 INFO L225 Difference]: With dead ends: 357 [2024-10-24 15:46:13,120 INFO L226 Difference]: Without dead ends: 357 [2024-10-24 15:46:13,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 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-24 15:46:13,120 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 5 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:13,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 781 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:46:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-24 15:46:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2024-10-24 15:46:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 326 states have (on average 1.2576687116564418) internal successors, (410), 334 states have internal predecessors, (410), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-24 15:46:13,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 446 transitions. [2024-10-24 15:46:13,127 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 446 transitions. Word has length 66 [2024-10-24 15:46:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:13,127 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 446 transitions. [2024-10-24 15:46:13,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 446 transitions. [2024-10-24 15:46:13,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-24 15:46:13,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:13,128 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:13,137 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-24 15:46:13,329 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-24 15:46:13,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:13,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:13,330 INFO L85 PathProgramCache]: Analyzing trace with hash 2071587203, now seen corresponding path program 2 times [2024-10-24 15:46:13,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:13,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830149663] [2024-10-24 15:46:13,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:46:13,331 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-24 15:46:13,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:13,333 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-24 15:46:13,334 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-24 15:46:13,792 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:46:13,792 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:13,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 15:46:13,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:13,890 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:13,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 15:46:14,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:14,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830149663] [2024-10-24 15:46:14,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830149663] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:14,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:14,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:46:14,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254498076] [2024-10-24 15:46:14,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:14,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:46:14,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:46:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:46:14,097 INFO L87 Difference]: Start difference. First operand 356 states and 446 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:14,681 INFO L93 Difference]: Finished difference Result 368 states and 465 transitions. [2024-10-24 15:46:14,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:46:14,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2024-10-24 15:46:14,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:14,683 INFO L225 Difference]: With dead ends: 368 [2024-10-24 15:46:14,684 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 15:46:14,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:46:14,684 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 8 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:14,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1558 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:46:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 15:46:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2024-10-24 15:46:14,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 335 states have (on average 1.2597014925373133) internal successors, (422), 343 states have internal predecessors, (422), 19 states have call successors, (19), 8 states have call predecessors, (19), 9 states have return successors, (17), 14 states have call predecessors, (17), 15 states have call successors, (17) [2024-10-24 15:46:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 458 transitions. [2024-10-24 15:46:14,691 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 458 transitions. Word has length 69 [2024-10-24 15:46:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:14,691 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 458 transitions. [2024-10-24 15:46:14,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-24 15:46:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 458 transitions. [2024-10-24 15:46:14,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-24 15:46:14,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:14,692 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:14,707 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 (10)] Forceful destruction successful, exit code 0 [2024-10-24 15:46:14,892 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-24 15:46:14,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:14,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1354008483, now seen corresponding path program 3 times [2024-10-24 15:46:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433372604] [2024-10-24 15:46:14,894 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:46:14,894 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-24 15:46:14,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:14,897 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-24 15:46:14,898 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-24 15:46:15,395 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:46:15,396 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:15,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 15:46:15,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 15:46:15,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-24 15:46:15,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433372604] [2024-10-24 15:46:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433372604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:15,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:15,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-24 15:46:15,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419224858] [2024-10-24 15:46:15,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:15,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 15:46:15,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:15,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 15:46:15,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-24 15:46:15,761 INFO L87 Difference]: Start difference. First operand 365 states and 458 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:46:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:16,956 INFO L93 Difference]: Finished difference Result 2684 states and 3423 transitions. [2024-10-24 15:46:16,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-24 15:46:16,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2024-10-24 15:46:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:16,964 INFO L225 Difference]: With dead ends: 2684 [2024-10-24 15:46:16,964 INFO L226 Difference]: Without dead ends: 2684 [2024-10-24 15:46:16,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-10-24 15:46:16,965 INFO L432 NwaCegarLoop]: 724 mSDtfsCounter, 3414 mSDsluCounter, 3841 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3440 SdHoareTripleChecker+Valid, 4565 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:16,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3440 Valid, 4565 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 15:46:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2024-10-24 15:46:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 1858. [2024-10-24 15:46:16,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1858 states, 1764 states have (on average 1.2704081632653061) internal successors, (2241), 1778 states have internal predecessors, (2241), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-10-24 15:46:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1858 states to 1858 states and 2361 transitions. [2024-10-24 15:46:17,001 INFO L78 Accepts]: Start accepts. Automaton has 1858 states and 2361 transitions. Word has length 75 [2024-10-24 15:46:17,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:17,001 INFO L471 AbstractCegarLoop]: Abstraction has 1858 states and 2361 transitions. [2024-10-24 15:46:17,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 15:46:17,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1858 states and 2361 transitions. [2024-10-24 15:46:17,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 15:46:17,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:17,002 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:17,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-24 15:46:17,203 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-24 15:46:17,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:17,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:17,204 INFO L85 PathProgramCache]: Analyzing trace with hash 445728410, now seen corresponding path program 1 times [2024-10-24 15:46:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:17,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689025416] [2024-10-24 15:46:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:17,205 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-24 15:46:17,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:17,207 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-24 15:46:17,208 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-24 15:46:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:17,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 15:46:17,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:46:17,861 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-24 15:46:18,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689025416] [2024-10-24 15:46:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689025416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:18,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:18,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:46:18,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198427785] [2024-10-24 15:46:18,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:18,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:46:18,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:18,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:46:18,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:46:18,431 INFO L87 Difference]: Start difference. First operand 1858 states and 2361 transitions. Second operand has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 15:46:20,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:20,866 INFO L93 Difference]: Finished difference Result 1963 states and 2546 transitions. [2024-10-24 15:46:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:46:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2024-10-24 15:46:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:20,872 INFO L225 Difference]: With dead ends: 1963 [2024-10-24 15:46:20,872 INFO L226 Difference]: Without dead ends: 1953 [2024-10-24 15:46:20,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:46:20,873 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 13 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3371 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:20,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3371 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 15:46:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2024-10-24 15:46:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1948. [2024-10-24 15:46:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1854 states have (on average 1.273462783171521) internal successors, (2361), 1868 states have internal predecessors, (2361), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-10-24 15:46:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2481 transitions. [2024-10-24 15:46:20,916 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2481 transitions. Word has length 111 [2024-10-24 15:46:20,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:20,917 INFO L471 AbstractCegarLoop]: Abstraction has 1948 states and 2481 transitions. [2024-10-24 15:46:20,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-24 15:46:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2481 transitions. [2024-10-24 15:46:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 15:46:20,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:20,918 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:46:20,933 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-24 15:46:21,118 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-24 15:46:21,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash -435129094, now seen corresponding path program 2 times [2024-10-24 15:46:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678447135] [2024-10-24 15:46:21,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:46:21,120 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-24 15:46:21,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:21,123 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-24 15:46:21,124 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-24 15:46:21,415 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:46:21,416 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:21,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:46:21,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:21,432 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:21,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:21,433 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:46:21,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 15:46:21,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:46:21,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 15:46:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-10-24 15:46:21,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:46:21,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:21,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678447135] [2024-10-24 15:46:21,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678447135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:46:21,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:46:21,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:46:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953860882] [2024-10-24 15:46:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:46:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:46:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:46:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:46:21,473 INFO L87 Difference]: Start difference. First operand 1948 states and 2481 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 15:46:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:21,816 INFO L93 Difference]: Finished difference Result 2700 states and 3483 transitions. [2024-10-24 15:46:21,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:46:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 129 [2024-10-24 15:46:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:21,823 INFO L225 Difference]: With dead ends: 2700 [2024-10-24 15:46:21,823 INFO L226 Difference]: Without dead ends: 2700 [2024-10-24 15:46:21,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-24 15:46:21,824 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 212 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:21,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 729 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:46:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2024-10-24 15:46:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 1960. [2024-10-24 15:46:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1960 states, 1866 states have (on average 1.2717041800643087) internal successors, (2373), 1880 states have internal predecessors, (2373), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-10-24 15:46:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 2493 transitions. [2024-10-24 15:46:21,852 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 2493 transitions. Word has length 129 [2024-10-24 15:46:21,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:21,853 INFO L471 AbstractCegarLoop]: Abstraction has 1960 states and 2493 transitions. [2024-10-24 15:46:21,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-24 15:46:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 2493 transitions. [2024-10-24 15:46:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 15:46:21,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:21,854 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 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] [2024-10-24 15:46:21,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 15:46:22,055 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-24 15:46:22,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:22,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:22,057 INFO L85 PathProgramCache]: Analyzing trace with hash -427519190, now seen corresponding path program 1 times [2024-10-24 15:46:22,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698325889] [2024-10-24 15:46:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:46:22,058 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-24 15:46:22,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:22,060 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-24 15:46:22,061 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-24 15:46:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:46:22,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 15:46:22,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 311 proven. 253 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-24 15:46:23,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-24 15:46:24,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698325889] [2024-10-24 15:46:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698325889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:24,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:24,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:46:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932929131] [2024-10-24 15:46:24,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:24,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:46:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:24,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:46:24,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:46:24,953 INFO L87 Difference]: Start difference. First operand 1960 states and 2493 transitions. Second operand has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 15:46:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:46:41,604 INFO L93 Difference]: Finished difference Result 2145 states and 2838 transitions. [2024-10-24 15:46:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:46:41,604 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 133 [2024-10-24 15:46:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:46:41,610 INFO L225 Difference]: With dead ends: 2145 [2024-10-24 15:46:41,610 INFO L226 Difference]: Without dead ends: 2135 [2024-10-24 15:46:41,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:46:41,613 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 25 mSDsluCounter, 5957 mSDsCounter, 0 mSdLazyCounter, 2121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:46:41,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6220 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2121 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-24 15:46:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2024-10-24 15:46:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 2130. [2024-10-24 15:46:41,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2036 states have (on average 1.2784872298624754) internal successors, (2603), 2050 states have internal predecessors, (2603), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-10-24 15:46:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2723 transitions. [2024-10-24 15:46:41,664 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 2723 transitions. Word has length 133 [2024-10-24 15:46:41,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:46:41,665 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 2723 transitions. [2024-10-24 15:46:41,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 15:46:41,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 2723 transitions. [2024-10-24 15:46:41,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 15:46:41,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:46:41,666 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 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] [2024-10-24 15:46:41,683 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-24 15:46:41,870 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-24 15:46:41,871 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:46:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:46:41,871 INFO L85 PathProgramCache]: Analyzing trace with hash -418142070, now seen corresponding path program 2 times [2024-10-24 15:46:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:46:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942308377] [2024-10-24 15:46:41,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:46:41,872 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-24 15:46:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:46:41,874 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-24 15:46:41,883 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-24 15:46:43,886 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:46:43,886 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:46:43,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-24 15:46:43,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:46:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1162 proven. 276 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2024-10-24 15:46:44,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:46:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1081 proven. 301 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2024-10-24 15:46:48,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:46:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942308377] [2024-10-24 15:46:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942308377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:46:48,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:46:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:46:48,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770217633] [2024-10-24 15:46:48,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:46:48,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:46:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:46:48,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:46:48,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:46:48,012 INFO L87 Difference]: Start difference. First operand 2130 states and 2723 transitions. Second operand has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 15:47:04,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:47:04,335 INFO L93 Difference]: Finished difference Result 2265 states and 2983 transitions. [2024-10-24 15:47:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:47:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 167 [2024-10-24 15:47:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:47:04,341 INFO L225 Difference]: With dead ends: 2265 [2024-10-24 15:47:04,342 INFO L226 Difference]: Without dead ends: 2265 [2024-10-24 15:47:04,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:47:04,344 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 27 mSDsluCounter, 6475 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6737 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:47:04,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6737 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-24 15:47:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-10-24 15:47:04,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2255. [2024-10-24 15:47:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2161 states have (on average 1.3202221193891717) internal successors, (2853), 2175 states have internal predecessors, (2853), 58 states have call successors, (58), 32 states have call predecessors, (58), 34 states have return successors, (62), 47 states have call predecessors, (62), 54 states have call successors, (62) [2024-10-24 15:47:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 2973 transitions. [2024-10-24 15:47:04,373 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 2973 transitions. Word has length 167 [2024-10-24 15:47:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:47:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 2255 states and 2973 transitions. [2024-10-24 15:47:04,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-24 15:47:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 2973 transitions. [2024-10-24 15:47:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-24 15:47:04,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:47:04,375 INFO L215 NwaCegarLoop]: trace histogram [92, 3, 3, 3, 3, 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] [2024-10-24 15:47:04,400 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 (15)] Ended with exit code 0 [2024-10-24 15:47:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-24 15:47:04,580 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:47:04,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:47:04,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1641405979, now seen corresponding path program 3 times [2024-10-24 15:47:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:47:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607223424] [2024-10-24 15:47:04,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 15:47:04,581 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-24 15:47:04,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:47:04,583 INFO L229 MonitoredProcess]: Starting monitored process 16 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-24 15:47:04,583 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 (16)] Waiting until timeout for monitored process [2024-10-24 15:47:05,902 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-24 15:47:05,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:47:05,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 15:47:05,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:47:05,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 53 [2024-10-24 15:47:06,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 454 treesize of output 334 [2024-10-24 15:47:06,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 214 [2024-10-24 15:47:06,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:47:06,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 94 [2024-10-24 15:47:07,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 116 [2024-10-24 15:47:07,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 68 [2024-10-24 15:47:07,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:47:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 68 treesize of output 20 [2024-10-24 15:47:08,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:47:08,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 106 [2024-10-24 15:47:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4483 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 4379 trivial. 0 not checked. [2024-10-24 15:47:08,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:47:08,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:47:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607223424] [2024-10-24 15:47:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607223424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:47:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:47:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 15:47:08,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949295387] [2024-10-24 15:47:08,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:47:08,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 15:47:08,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:47:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 15:47:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-24 15:47:08,546 INFO L87 Difference]: Start difference. First operand 2255 states and 2973 transitions. Second operand has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 15:47:11,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:47:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:47:18,763 INFO L93 Difference]: Finished difference Result 2814 states and 3701 transitions. [2024-10-24 15:47:18,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 15:47:18,764 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 192 [2024-10-24 15:47:18,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:47:18,771 INFO L225 Difference]: With dead ends: 2814 [2024-10-24 15:47:18,771 INFO L226 Difference]: Without dead ends: 2809 [2024-10-24 15:47:18,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-24 15:47:18,771 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 371 mSDsluCounter, 2744 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:47:18,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 3017 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2024-10-24 15:47:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2024-10-24 15:47:18,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2504. [2024-10-24 15:47:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2504 states, 2401 states have (on average 1.3065389421074551) internal successors, (3137), 2416 states have internal predecessors, (3137), 62 states have call successors, (62), 36 states have call predecessors, (62), 39 states have return successors, (71), 51 states have call predecessors, (71), 58 states have call successors, (71) [2024-10-24 15:47:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3270 transitions. [2024-10-24 15:47:18,821 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3270 transitions. Word has length 192 [2024-10-24 15:47:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:47:18,822 INFO L471 AbstractCegarLoop]: Abstraction has 2504 states and 3270 transitions. [2024-10-24 15:47:18,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-24 15:47:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3270 transitions. [2024-10-24 15:47:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-24 15:47:18,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:47:18,823 INFO L215 NwaCegarLoop]: trace histogram [93, 3, 3, 3, 3, 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] [2024-10-24 15:47:18,842 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 (16)] Ended with exit code 0 [2024-10-24 15:47:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-24 15:47:19,028 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:47:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:47:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash -65008132, now seen corresponding path program 4 times [2024-10-24 15:47:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:47:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461093550] [2024-10-24 15:47:19,030 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 15:47:19,030 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-24 15:47:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:47:19,032 INFO L229 MonitoredProcess]: Starting monitored process 17 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-24 15:47:19,033 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 (17)] Waiting until timeout for monitored process [2024-10-24 15:47:21,223 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 15:47:21,224 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:47:21,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-24 15:47:21,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:47:24,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2406 proven. 1176 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-24 15:47:24,059 INFO L311 TraceCheckSpWp]: Computing backward predicates...