./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.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_JEN_test9-2.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 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:52:37,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:52:37,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-24 15:52:37,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:52:37,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:52:37,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:52:37,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:52:37,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:52:37,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:52:37,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:52:37,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:52:37,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:52:37,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:52:37,734 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:52:37,734 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:52:37,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:52:37,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:52:37,736 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:52:37,736 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:52:37,736 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:52:37,736 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:52:37,737 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:52:37,737 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:52:37,738 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:52:37,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:52:37,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:52:37,738 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:52:37,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:52:37,739 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:52:37,739 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:52:37,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:52:37,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:52:37,740 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:52:37,740 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:52:37,740 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:52:37,740 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:52:37,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:52:37,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:52:37,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:52:37,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 15:52:37,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 15:52:37,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:52:37,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:52:37,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:52:37,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:52:37,742 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 -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2024-10-24 15:52:37,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:52:37,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:52:37,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:52:37,973 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:52:37,973 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:52:37,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-24 15:52:39,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:52:39,451 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:52:39,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-24 15:52:39,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c10c742/ecb02d1851ad4d75b41ced0659f1f58c/FLAG7aab0372d [2024-10-24 15:52:39,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c10c742/ecb02d1851ad4d75b41ced0659f1f58c [2024-10-24 15:52:39,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:52:39,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:52:39,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:39,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:52:39,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:52:39,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:39" (1/1) ... [2024-10-24 15:52:39,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9bf9a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:39, skipping insertion in model container [2024-10-24 15:52:39,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:39" (1/1) ... [2024-10-24 15:52:39,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:52:40,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:40,337 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:52:40,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7ee82bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:40, skipping insertion in model container [2024-10-24 15:52:40,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:40,338 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 15:52:40,339 INFO L158 Benchmark]: Toolchain (without parser) took 596.96ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 75.1MB in the beginning and 143.6MB in the end (delta: -68.6MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-10-24 15:52:40,340 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 15:52:40,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 594.59ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 74.8MB in the beginning and 143.6MB in the end (delta: -68.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-24 15:52:40,345 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.18ms. Allocated memory is still 151.0MB. Free memory is still 101.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 594.59ms. Allocated memory was 151.0MB in the beginning and 197.1MB in the end (delta: 46.1MB). Free memory was 74.8MB in the beginning and 143.6MB in the end (delta: -68.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2221]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.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 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 15:52:42,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 15:52:42,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-24 15:52:42,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 15:52:42,082 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 15:52:42,108 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 15:52:42,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 15:52:42,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 15:52:42,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 15:52:42,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 15:52:42,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 15:52:42,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 15:52:42,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 15:52:42,112 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 15:52:42,112 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 15:52:42,112 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 15:52:42,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 15:52:42,113 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 15:52:42,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 15:52:42,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 15:52:42,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 15:52:42,114 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 15:52:42,114 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 15:52:42,114 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 15:52:42,115 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 15:52:42,115 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 15:52:42,115 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 15:52:42,115 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 15:52:42,116 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 15:52:42,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 15:52:42,116 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 15:52:42,116 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 15:52:42,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 15:52:42,117 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 15:52:42,117 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 15:52:42,117 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 15:52:42,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 15:52:42,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 15:52:42,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:52:42,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 15:52:42,119 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 15:52:42,120 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 -> 961225f1af8bda006e5a86aed07a62a3e426daf2d218eb9a2332372592a548eb [2024-10-24 15:52:42,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 15:52:42,415 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 15:52:42,417 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 15:52:42,418 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 15:52:42,418 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 15:52:42,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-24 15:52:43,679 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 15:52:43,959 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 15:52:43,960 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test9-2.i [2024-10-24 15:52:43,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d55ee0f/2beaca2e52e74c3a924d37a9848c65b8/FLAGbc7a8128a [2024-10-24 15:52:43,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1d55ee0f/2beaca2e52e74c3a924d37a9848c65b8 [2024-10-24 15:52:43,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 15:52:43,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 15:52:43,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:43,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 15:52:44,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 15:52:44,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:43" (1/1) ... [2024-10-24 15:52:44,003 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a3b847d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44, skipping insertion in model container [2024-10-24 15:52:44,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:52:43" (1/1) ... [2024-10-24 15:52:44,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:52:44,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:44,574 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 15:52:44,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 15:52:44,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:44,708 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 15:52:44,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 15:52:44,832 INFO L204 MainTranslator]: Completed translation [2024-10-24 15:52:44,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44 WrapperNode [2024-10-24 15:52:44,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 15:52:44,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 15:52:44,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 15:52:44,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 15:52:44,838 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:52:44" (1/1) ... [2024-10-24 15:52:44,878 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:52:44" (1/1) ... [2024-10-24 15:52:44,967 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3043 [2024-10-24 15:52:44,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 15:52:44,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 15:52:44,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 15:52:44,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 15:52:44,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:44,977 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:44,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,073 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-24 15:52:45,073 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,138 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 15:52:45,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 15:52:45,180 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 15:52:45,180 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 15:52:45,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (1/1) ... [2024-10-24 15:52:45,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 15:52:45,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 15:52:45,210 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:52:45,243 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:52:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 15:52:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 15:52:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 15:52:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 15:52:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 15:52:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 15:52:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 15:52:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 15:52:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 15:52:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 15:52:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 15:52:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 15:52:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 15:52:45,304 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 15:52:45,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 15:52:45,305 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 15:52:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 15:52:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 15:52:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 15:52:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 15:52:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 15:52:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 15:52:45,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 15:52:45,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 15:52:45,519 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 15:52:45,521 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 15:52:53,443 INFO L? ?]: Removed 638 outVars from TransFormulas that were not future-live. [2024-10-24 15:52:53,444 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 15:52:53,490 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 15:52:53,490 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-24 15:52:53,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:52:53 BoogieIcfgContainer [2024-10-24 15:52:53,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 15:52:53,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 15:52:53,492 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 15:52:53,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 15:52:53,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:52:43" (1/3) ... [2024-10-24 15:52:53,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77446699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:52:53, skipping insertion in model container [2024-10-24 15:52:53,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:52:44" (2/3) ... [2024-10-24 15:52:53,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77446699 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:52:53, skipping insertion in model container [2024-10-24 15:52:53,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:52:53" (3/3) ... [2024-10-24 15:52:53,498 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test9-2.i [2024-10-24 15:52:53,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 15:52:53,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 15:52:53,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 15:52:53,569 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;@24c884bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 15:52:53,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 15:52:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-10-24 15:52:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-24 15:52:53,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:52:53,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:52:53,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:52:53,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:52:53,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1977665458, now seen corresponding path program 1 times [2024-10-24 15:52:53,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:52:53,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939893227] [2024-10-24 15:52:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:52:53,600 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:52:53,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:52:53,603 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:52:53,604 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:52:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:52:53,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 15:52:53,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:52:53,753 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:52:53,753 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:52:53,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:52:53,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939893227] [2024-10-24 15:52:53,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1939893227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:52:53,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:52:53,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:52:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134190902] [2024-10-24 15:52:53,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:52:53,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 15:52:53,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:52:53,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 15:52:53,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:52:53,781 INFO L87 Difference]: Start difference. First operand has 1202 states, 691 states have (on average 1.9088277858176557) internal successors, (1319), 1195 states have internal predecessors, (1319), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:52:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:52:53,894 INFO L93 Difference]: Finished difference Result 1200 states and 2257 transitions. [2024-10-24 15:52:53,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 15:52:53,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-24 15:52:53,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:52:53,916 INFO L225 Difference]: With dead ends: 1200 [2024-10-24 15:52:53,917 INFO L226 Difference]: Without dead ends: 1199 [2024-10-24 15:52:53,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 15:52:53,920 INFO L432 NwaCegarLoop]: 2252 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 15:52:53,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 15:52:53,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2024-10-24 15:52:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1199. [2024-10-24 15:52:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 690 states have (on average 1.808695652173913) internal successors, (1248), 1192 states have internal predecessors, (1248), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-10-24 15:52:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2256 transitions. [2024-10-24 15:52:54,162 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2256 transitions. Word has length 10 [2024-10-24 15:52:54,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:52:54,162 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 2256 transitions. [2024-10-24 15:52:54,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:52:54,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2256 transitions. [2024-10-24 15:52:54,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 15:52:54,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:52:54,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:52:54,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 15:52:54,364 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:52:54,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:52:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:52:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 595513586, now seen corresponding path program 1 times [2024-10-24 15:52:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:52:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824952313] [2024-10-24 15:52:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:52:54,367 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:52:54,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:52:54,397 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:52:54,398 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:52:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:52:54,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:52:54,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:52:54,659 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:52:54,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:52:54,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:52:54,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824952313] [2024-10-24 15:52:54,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824952313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:52:54,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:52:54,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 15:52:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154862287] [2024-10-24 15:52:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:52:54,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:52:54,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:52:54,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:52:54,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:52:54,662 INFO L87 Difference]: Start difference. First operand 1199 states and 2256 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:52:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:52:55,461 INFO L93 Difference]: Finished difference Result 2319 states and 4412 transitions. [2024-10-24 15:52:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:52:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 15:52:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:52:55,476 INFO L225 Difference]: With dead ends: 2319 [2024-10-24 15:52:55,477 INFO L226 Difference]: Without dead ends: 2319 [2024-10-24 15:52:55,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:52:55,478 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 1146 mSDsluCounter, 2227 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 4467 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:52:55,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 4467 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 15:52:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-10-24 15:52:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2288. [2024-10-24 15:52:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2288 states, 1279 states have (on average 1.8483189992181392) internal successors, (2364), 2281 states have internal predecessors, (2364), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-24 15:52:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 4372 transitions. [2024-10-24 15:52:55,702 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 4372 transitions. Word has length 12 [2024-10-24 15:52:55,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:52:55,702 INFO L471 AbstractCegarLoop]: Abstraction has 2288 states and 4372 transitions. [2024-10-24 15:52:55,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:52:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 4372 transitions. [2024-10-24 15:52:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 15:52:55,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:52:55,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:52:55,707 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:52:55,904 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:52:55,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:52:55,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:52:55,905 INFO L85 PathProgramCache]: Analyzing trace with hash 597360628, now seen corresponding path program 1 times [2024-10-24 15:52:55,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:52:55,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903326848] [2024-10-24 15:52:55,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:52:55,906 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:52:55,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:52:55,907 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:52:55,908 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:52:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:52:56,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:52:56,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:52:56,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:52:56,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:52:56,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:52:56,061 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:52:56,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:52:56,116 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:52:56,133 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:52:56,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:52:56,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:52:56,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903326848] [2024-10-24 15:52:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903326848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:52:56,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:52:56,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:52:56,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690647037] [2024-10-24 15:52:56,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:52:56,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:52:56,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:52:56,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:52:56,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:52:56,136 INFO L87 Difference]: Start difference. First operand 2288 states and 4372 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:52:58,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:52:58,068 INFO L93 Difference]: Finished difference Result 4434 states and 8563 transitions. [2024-10-24 15:52:58,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:52:58,069 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-24 15:52:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:52:58,085 INFO L225 Difference]: With dead ends: 4434 [2024-10-24 15:52:58,085 INFO L226 Difference]: Without dead ends: 4434 [2024-10-24 15:52:58,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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:52:58,086 INFO L432 NwaCegarLoop]: 2467 mSDtfsCounter, 1229 mSDsluCounter, 4194 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 15:52:58,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 6661 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 15:52:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2024-10-24 15:52:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 2287. [2024-10-24 15:52:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2287 states, 1278 states have (on average 1.8482003129890454) internal successors, (2362), 2280 states have internal predecessors, (2362), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-24 15:52:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 4370 transitions. [2024-10-24 15:52:58,458 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 4370 transitions. Word has length 12 [2024-10-24 15:52:58,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:52:58,459 INFO L471 AbstractCegarLoop]: Abstraction has 2287 states and 4370 transitions. [2024-10-24 15:52:58,459 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 15:52:58,459 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 4370 transitions. [2024-10-24 15:52:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 15:52:58,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:52:58,464 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:52:58,471 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:52:58,664 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:52:58,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:52:58,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:52:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash -833134923, now seen corresponding path program 1 times [2024-10-24 15:52:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:52:58,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674030256] [2024-10-24 15:52:58,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:52:58,669 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:52:58,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:52:58,673 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:52:58,675 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:52:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:52:59,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:52:59,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:52:59,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 15:52:59,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:52:59,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:52:59,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674030256] [2024-10-24 15:52:59,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674030256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:52:59,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:52:59,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:52:59,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063351228] [2024-10-24 15:52:59,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:52:59,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:52:59,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:52:59,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:52:59,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:52:59,065 INFO L87 Difference]: Start difference. First operand 2287 states and 4370 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:52:59,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:52:59,209 INFO L93 Difference]: Finished difference Result 2293 states and 4360 transitions. [2024-10-24 15:52:59,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:52:59,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-24 15:52:59,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:52:59,218 INFO L225 Difference]: With dead ends: 2293 [2024-10-24 15:52:59,219 INFO L226 Difference]: Without dead ends: 2293 [2024-10-24 15:52:59,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 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:52:59,221 INFO L432 NwaCegarLoop]: 2222 mSDtfsCounter, 30 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6649 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:52:59,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6649 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:52:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2024-10-24 15:52:59,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2293. [2024-10-24 15:52:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2293 states, 1284 states have (on average 1.8317757009345794) internal successors, (2352), 2286 states have internal predecessors, (2352), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-10-24 15:52:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2293 states to 2293 states and 4360 transitions. [2024-10-24 15:52:59,395 INFO L78 Accepts]: Start accepts. Automaton has 2293 states and 4360 transitions. Word has length 81 [2024-10-24 15:52:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:52:59,395 INFO L471 AbstractCegarLoop]: Abstraction has 2293 states and 4360 transitions. [2024-10-24 15:52:59,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:52:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2293 states and 4360 transitions. [2024-10-24 15:52:59,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 15:52:59,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:52:59,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:52:59,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 15:52:59,597 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:52:59,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:52:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:52:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash -757174847, now seen corresponding path program 1 times [2024-10-24 15:52:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:52:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092318155] [2024-10-24 15:52:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:52:59,600 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:52:59,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:52:59,604 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:52:59,606 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:52:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:52:59,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:52:59,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:52:59,996 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:52:59,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:52:59,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:52:59,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092318155] [2024-10-24 15:52:59,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092318155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:52:59,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:52:59,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:52:59,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098408389] [2024-10-24 15:52:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:52:59,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:52:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:52:59,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:52:59,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:52:59,998 INFO L87 Difference]: Start difference. First operand 2293 states and 4360 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:53:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:00,082 INFO L93 Difference]: Finished difference Result 2295 states and 4363 transitions. [2024-10-24 15:53:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:53:00,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2024-10-24 15:53:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:00,093 INFO L225 Difference]: With dead ends: 2295 [2024-10-24 15:53:00,093 INFO L226 Difference]: Without dead ends: 2295 [2024-10-24 15:53:00,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 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:53:00,094 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 0 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:00,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6713 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2295 states. [2024-10-24 15:53:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2295 to 2295. [2024-10-24 15:53:00,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 1285 states have (on average 1.8319066147859921) internal successors, (2354), 2288 states have internal predecessors, (2354), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-24 15:53:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 4363 transitions. [2024-10-24 15:53:00,286 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 4363 transitions. Word has length 81 [2024-10-24 15:53:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 4363 transitions. [2024-10-24 15:53:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-24 15:53:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 4363 transitions. [2024-10-24 15:53:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 15:53:00,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:00,290 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:00,300 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:53:00,490 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:53:00,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:00,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:00,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1719600183, now seen corresponding path program 1 times [2024-10-24 15:53:00,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:00,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076366893] [2024-10-24 15:53:00,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:00,492 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:53:00,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:00,496 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:53:00,497 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:53:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:00,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:53:00,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 15:53:00,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:00,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 15:53:00,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076366893] [2024-10-24 15:53:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076366893] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:00,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:00,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 15:53:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444458330] [2024-10-24 15:53:00,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 15:53:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:00,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 15:53:00,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 15:53:00,991 INFO L87 Difference]: Start difference. First operand 2295 states and 4363 transitions. Second operand has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:01,177 INFO L93 Difference]: Finished difference Result 2304 states and 4377 transitions. [2024-10-24 15:53:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 15:53:01,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-10-24 15:53:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:01,186 INFO L225 Difference]: With dead ends: 2304 [2024-10-24 15:53:01,186 INFO L226 Difference]: Without dead ends: 2304 [2024-10-24 15:53:01,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 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:53:01,187 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 4 mSDsluCounter, 4474 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:01,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 6713 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-10-24 15:53:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2303. [2024-10-24 15:53:01,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2303 states, 1292 states have (on average 1.8320433436532508) internal successors, (2367), 2295 states have internal predecessors, (2367), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-10-24 15:53:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2303 states to 2303 states and 4376 transitions. [2024-10-24 15:53:01,388 INFO L78 Accepts]: Start accepts. Automaton has 2303 states and 4376 transitions. Word has length 83 [2024-10-24 15:53:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:01,388 INFO L471 AbstractCegarLoop]: Abstraction has 2303 states and 4376 transitions. [2024-10-24 15:53:01,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2303 states and 4376 transitions. [2024-10-24 15:53:01,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 15:53:01,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:01,389 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:01,400 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 (7)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:01,593 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:53:01,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:01,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash -597927647, now seen corresponding path program 2 times [2024-10-24 15:53:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:01,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250585552] [2024-10-24 15:53:01,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:01,595 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:53:01,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:01,598 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:53:01,602 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:53:01,803 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:53:01,803 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:01,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 15:53:01,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 15:53:01,856 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:01,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:01,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250585552] [2024-10-24 15:53:01,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250585552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:01,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:01,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:53:01,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829841349] [2024-10-24 15:53:01,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:01,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:01,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:01,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:01,859 INFO L87 Difference]: Start difference. First operand 2303 states and 4376 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:06,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:53:10,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-24 15:53:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:14,427 INFO L93 Difference]: Finished difference Result 3435 states and 6550 transitions. [2024-10-24 15:53:14,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:53:14,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-24 15:53:14,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:14,444 INFO L225 Difference]: With dead ends: 3435 [2024-10-24 15:53:14,444 INFO L226 Difference]: Without dead ends: 3435 [2024-10-24 15:53:14,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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:53:14,445 INFO L432 NwaCegarLoop]: 2310 mSDtfsCounter, 3542 mSDsluCounter, 2206 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 895 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4045 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:14,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4045 Valid, 4516 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 618 Invalid, 2 Unknown, 0 Unchecked, 12.5s Time] [2024-10-24 15:53:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2024-10-24 15:53:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3410. [2024-10-24 15:53:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3410 states, 1898 states have (on average 1.8461538461538463) internal successors, (3504), 3401 states have internal predecessors, (3504), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3410 states to 3410 states and 6516 transitions. [2024-10-24 15:53:14,744 INFO L78 Accepts]: Start accepts. Automaton has 3410 states and 6516 transitions. Word has length 87 [2024-10-24 15:53:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:14,745 INFO L471 AbstractCegarLoop]: Abstraction has 3410 states and 6516 transitions. [2024-10-24 15:53:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3410 states and 6516 transitions. [2024-10-24 15:53:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 15:53:14,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:14,746 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:14,752 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:53:14,946 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:53:14,947 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -587869840, now seen corresponding path program 1 times [2024-10-24 15:53:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1488084093] [2024-10-24 15:53:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:14,950 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:53:14,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:14,952 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:53:14,953 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:53:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:15,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 15:53:15,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 15:53:15,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-24 15:53:15,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:15,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1488084093] [2024-10-24 15:53:15,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1488084093] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:15,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:15,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 15:53:15,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301027080] [2024-10-24 15:53:15,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:15,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 15:53:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:15,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 15:53:15,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 15:53:15,552 INFO L87 Difference]: Start difference. First operand 3410 states and 6516 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:16,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:16,045 INFO L93 Difference]: Finished difference Result 3422 states and 6536 transitions. [2024-10-24 15:53:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 15:53:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-10-24 15:53:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:16,074 INFO L225 Difference]: With dead ends: 3422 [2024-10-24 15:53:16,074 INFO L226 Difference]: Without dead ends: 3420 [2024-10-24 15:53:16,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 15:53:16,075 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 7 mSDsluCounter, 15651 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 17890 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:16,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 17890 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 15:53:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3420 states. [2024-10-24 15:53:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3420 to 3419. [2024-10-24 15:53:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 1907 states have (on average 1.8437336130047195) internal successors, (3516), 3410 states have internal predecessors, (3516), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 6528 transitions. [2024-10-24 15:53:16,343 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 6528 transitions. Word has length 96 [2024-10-24 15:53:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:16,344 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 6528 transitions. [2024-10-24 15:53:16,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 6528 transitions. [2024-10-24 15:53:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 15:53:16,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:16,345 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:16,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-24 15:53:16,546 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:53:16,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:16,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash 902003159, now seen corresponding path program 2 times [2024-10-24 15:53:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:16,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856430971] [2024-10-24 15:53:16,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:16,548 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:53:16,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:16,550 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:53:16,552 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:53:16,828 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:53:16,828 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:16,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 15:53:16,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:16,848 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:53:16,849 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:53:16,849 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 15:53:16,851 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:53:16,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 15:53:16,895 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:53:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-24 15:53:16,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:16,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:16,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856430971] [2024-10-24 15:53:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856430971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:53:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493547383] [2024-10-24 15:53:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:16,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:16,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:16,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:16,908 INFO L87 Difference]: Start difference. First operand 3419 states and 6528 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:18,393 INFO L93 Difference]: Finished difference Result 6597 states and 12760 transitions. [2024-10-24 15:53:18,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 15:53:18,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-10-24 15:53:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:18,415 INFO L225 Difference]: With dead ends: 6597 [2024-10-24 15:53:18,415 INFO L226 Difference]: Without dead ends: 6597 [2024-10-24 15:53:18,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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:53:18,416 INFO L432 NwaCegarLoop]: 2671 mSDtfsCounter, 1176 mSDsluCounter, 4387 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 7058 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:18,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 7058 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 15:53:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2024-10-24 15:53:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 3423. [2024-10-24 15:53:18,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 1911 states have (on average 1.8419675562532705) internal successors, (3520), 3414 states have internal predecessors, (3520), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 6532 transitions. [2024-10-24 15:53:18,981 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 6532 transitions. Word has length 105 [2024-10-24 15:53:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:18,981 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 6532 transitions. [2024-10-24 15:53:18,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 6532 transitions. [2024-10-24 15:53:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-24 15:53:18,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:18,983 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:18,987 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:53:19,183 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:53:19,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:19,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:19,184 INFO L85 PathProgramCache]: Analyzing trace with hash 953298136, now seen corresponding path program 1 times [2024-10-24 15:53:19,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:19,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107399952] [2024-10-24 15:53:19,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:19,184 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:53:19,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:19,186 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:53:19,187 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:53:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:19,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 15:53:19,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:19,738 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 15:53:19,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-24 15:53:20,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107399952] [2024-10-24 15:53:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107399952] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:20,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 15:53:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424029645] [2024-10-24 15:53:20,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:20,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 15:53:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:20,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 15:53:20,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 15:53:20,173 INFO L87 Difference]: Start difference. First operand 3423 states and 6532 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:21,570 INFO L93 Difference]: Finished difference Result 3444 states and 6570 transitions. [2024-10-24 15:53:21,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 15:53:21,572 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-10-24 15:53:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:21,578 INFO L225 Difference]: With dead ends: 3444 [2024-10-24 15:53:21,578 INFO L226 Difference]: Without dead ends: 3442 [2024-10-24 15:53:21,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 15:53:21,579 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 13 mSDsluCounter, 26834 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29073 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:21,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 29073 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 15:53:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2024-10-24 15:53:21,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3441. [2024-10-24 15:53:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3441 states, 1929 states have (on average 1.8372213582166925) internal successors, (3544), 3432 states have internal predecessors, (3544), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:21,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3441 states to 3441 states and 6556 transitions. [2024-10-24 15:53:21,851 INFO L78 Accepts]: Start accepts. Automaton has 3441 states and 6556 transitions. Word has length 139 [2024-10-24 15:53:21,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:21,851 INFO L471 AbstractCegarLoop]: Abstraction has 3441 states and 6556 transitions. [2024-10-24 15:53:21,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3441 states and 6556 transitions. [2024-10-24 15:53:21,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 15:53:21,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:21,853 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:21,865 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:53:22,053 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:53:22,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:22,054 INFO L85 PathProgramCache]: Analyzing trace with hash 64827128, now seen corresponding path program 2 times [2024-10-24 15:53:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304099560] [2024-10-24 15:53:22,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:22,055 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:53:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:22,056 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:53:22,057 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:53:22,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:53:22,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:22,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 15:53:22,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 599 trivial. 0 not checked. [2024-10-24 15:53:22,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:22,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304099560] [2024-10-24 15:53:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304099560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:22,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:22,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 15:53:22,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471780354] [2024-10-24 15:53:22,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:22,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 15:53:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 15:53:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:53:22,358 INFO L87 Difference]: Start difference. First operand 3441 states and 6556 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:22,462 INFO L93 Difference]: Finished difference Result 3501 states and 6616 transitions. [2024-10-24 15:53:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 15:53:22,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-10-24 15:53:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:22,470 INFO L225 Difference]: With dead ends: 3501 [2024-10-24 15:53:22,470 INFO L226 Difference]: Without dead ends: 3501 [2024-10-24 15:53:22,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 15:53:22,471 INFO L432 NwaCegarLoop]: 2221 mSDtfsCounter, 7 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4428 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:22,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4428 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:22,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-10-24 15:53:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 3501. [2024-10-24 15:53:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3501 states, 1989 states have (on average 1.811965811965812) internal successors, (3604), 3492 states have internal predecessors, (3604), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3501 states to 3501 states and 6616 transitions. [2024-10-24 15:53:22,784 INFO L78 Accepts]: Start accepts. Automaton has 3501 states and 6616 transitions. Word has length 157 [2024-10-24 15:53:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 3501 states and 6616 transitions. [2024-10-24 15:53:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3501 states and 6616 transitions. [2024-10-24 15:53:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-24 15:53:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:22,786 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:22,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:22,986 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:53:22,987 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:22,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:22,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1228199932, now seen corresponding path program 1 times [2024-10-24 15:53:22,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:22,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969860487] [2024-10-24 15:53:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:22,988 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:53:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:22,989 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:53:22,990 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:53:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:23,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 15:53:23,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-10-24 15:53:23,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 2 proven. 530 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-24 15:53:25,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:25,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969860487] [2024-10-24 15:53:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969860487] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:25,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 15:53:25,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178379703] [2024-10-24 15:53:25,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:25,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 15:53:25,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:25,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 15:53:25,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 15:53:25,205 INFO L87 Difference]: Start difference. First operand 3501 states and 6616 transitions. Second operand has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:30,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:30,257 INFO L93 Difference]: Finished difference Result 3538 states and 6686 transitions. [2024-10-24 15:53:30,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 15:53:30,258 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 157 [2024-10-24 15:53:30,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:30,265 INFO L225 Difference]: With dead ends: 3538 [2024-10-24 15:53:30,266 INFO L226 Difference]: Without dead ends: 3536 [2024-10-24 15:53:30,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 15:53:30,268 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 26 mSDsluCounter, 53666 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55905 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:30,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55905 Invalid, 2067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 15:53:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2024-10-24 15:53:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3535. [2024-10-24 15:53:30,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3535 states, 2023 states have (on average 1.8042511122095897) internal successors, (3650), 3526 states have internal predecessors, (3650), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3535 states to 3535 states and 6662 transitions. [2024-10-24 15:53:30,542 INFO L78 Accepts]: Start accepts. Automaton has 3535 states and 6662 transitions. Word has length 157 [2024-10-24 15:53:30,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:30,543 INFO L471 AbstractCegarLoop]: Abstraction has 3535 states and 6662 transitions. [2024-10-24 15:53:30,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 15:53:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3535 states and 6662 transitions. [2024-10-24 15:53:30,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 15:53:30,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:30,544 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:30,745 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:53:30,745 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:30,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:30,745 INFO L85 PathProgramCache]: Analyzing trace with hash -282084836, now seen corresponding path program 2 times [2024-10-24 15:53:30,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:30,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615551670] [2024-10-24 15:53:30,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:30,746 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:53:30,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:30,747 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:53:30,748 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:53:31,094 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 15:53:31,094 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:31,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 15:53:31,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:31,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-10-24 15:53:31,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 15:53:31,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615551670] [2024-10-24 15:53:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615551670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 15:53:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 15:53:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 15:53:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186752180] [2024-10-24 15:53:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 15:53:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 15:53:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 15:53:31,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 15:53:31,121 INFO L87 Difference]: Start difference. First operand 3535 states and 6662 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:31,252 INFO L93 Difference]: Finished difference Result 3484 states and 6578 transitions. [2024-10-24 15:53:31,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 15:53:31,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 191 [2024-10-24 15:53:31,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:31,260 INFO L225 Difference]: With dead ends: 3484 [2024-10-24 15:53:31,261 INFO L226 Difference]: Without dead ends: 3484 [2024-10-24 15:53:31,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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:53:31,262 INFO L432 NwaCegarLoop]: 2208 mSDtfsCounter, 32 mSDsluCounter, 4404 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 6612 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:31,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 6612 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 15:53:31,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3484 states. [2024-10-24 15:53:31,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3484 to 3484. [2024-10-24 15:53:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 1972 states have (on average 1.808316430020284) internal successors, (3566), 3475 states have internal predecessors, (3566), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 6578 transitions. [2024-10-24 15:53:31,597 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 6578 transitions. Word has length 191 [2024-10-24 15:53:31,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:31,598 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 6578 transitions. [2024-10-24 15:53:31,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 15:53:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 6578 transitions. [2024-10-24 15:53:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-24 15:53:31,600 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:31,600 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:31,605 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:53:31,800 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:53:31,801 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:31,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:31,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1741851342, now seen corresponding path program 1 times [2024-10-24 15:53:31,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:31,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008120845] [2024-10-24 15:53:31,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 15:53:31,803 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:53:31,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:31,805 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:53:31,806 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:53:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 15:53:32,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 15:53:32,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:33,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:53:33,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 1083 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:53:34,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:34,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008120845] [2024-10-24 15:53:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008120845] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:34,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:34,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-24 15:53:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661651484] [2024-10-24 15:53:34,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:34,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-24 15:53:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:34,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-24 15:53:34,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-24 15:53:34,447 INFO L87 Difference]: Start difference. First operand 3484 states and 6578 transitions. Second operand has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:53:39,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 15:53:39,788 INFO L93 Difference]: Finished difference Result 3511 states and 6632 transitions. [2024-10-24 15:53:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-24 15:53:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 191 [2024-10-24 15:53:39,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 15:53:39,796 INFO L225 Difference]: With dead ends: 3511 [2024-10-24 15:53:39,797 INFO L226 Difference]: Without dead ends: 3511 [2024-10-24 15:53:39,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-24 15:53:39,799 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 27 mSDsluCounter, 57828 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 60055 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 15:53:39,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 60055 Invalid, 1527 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [46 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 15:53:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-24 15:53:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3509. [2024-10-24 15:53:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 1997 states have (on average 1.8107160741111668) internal successors, (3616), 3500 states have internal predecessors, (3616), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-10-24 15:53:40,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 6628 transitions. [2024-10-24 15:53:40,099 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 6628 transitions. Word has length 191 [2024-10-24 15:53:40,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 15:53:40,100 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 6628 transitions. [2024-10-24 15:53:40,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-24 15:53:40,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 6628 transitions. [2024-10-24 15:53:40,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-24 15:53:40,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 15:53:40,101 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 15:53:40,119 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 (15)] Forceful destruction successful, exit code 0 [2024-10-24 15:53:40,302 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:53:40,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-24 15:53:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 15:53:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -959724153, now seen corresponding path program 2 times [2024-10-24 15:53:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 15:53:40,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591533012] [2024-10-24 15:53:40,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 15:53:40,305 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:53:40,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 15:53:40,307 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:53:40,308 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:53:41,841 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 15:53:41,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 15:53:41,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-24 15:53:41,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 15:53:43,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:53:43,285 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 15:53:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2208 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-10-24 15:53:48,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 15:53:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591533012] [2024-10-24 15:53:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591533012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 15:53:48,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 15:53:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-24 15:53:48,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52184232] [2024-10-24 15:53:48,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 15:53:48,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-24 15:53:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 15:53:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-24 15:53:48,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-24 15:53:48,237 INFO L87 Difference]: Start difference. First operand 3509 states and 6628 transitions. Second operand has 102 states, 100 states have (on average 2.18) internal successors, (218), 102 states have internal predecessors, (218), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)