./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_SFH_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:41:31,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:41:31,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-11 17:41:31,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:41:31,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:41:31,676 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:41:31,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:41:31,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:41:31,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:41:31,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:41:31,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:41:31,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:41:31,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:41:31,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:41:31,684 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:41:31,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:41:31,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:41:31,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:41:31,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:41:31,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:41:31,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:41:31,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:41:31,687 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:41:31,687 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:41:31,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:41:31,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:41:31,688 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:41:31,688 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:41:31,688 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:41:31,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:41:31,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:41:31,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:41:31,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:41:31,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:41:31,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:41:31,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:41:31,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:41:31,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:41:31,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:41:31,694 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:41:31,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:41:31,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:41:31,694 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:41:31,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:41:31,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:41:31,695 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-clean/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-clean/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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2024-10-11 17:41:31,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:41:32,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:41:32,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:41:32,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:41:32,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:41:32,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-10-11 17:41:33,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:41:33,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:41:33,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-10-11 17:41:33,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6aa11405/1c73ef3b27854178a5fb30352c76c488/FLAG0521d6b34 [2024-10-11 17:41:33,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f6aa11405/1c73ef3b27854178a5fb30352c76c488 [2024-10-11 17:41:33,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:41:33,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:41:33,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:33,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:41:33,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:41:33,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:33" (1/1) ... [2024-10-11 17:41:33,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e03d6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:33, skipping insertion in model container [2024-10-11 17:41:33,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:33" (1/1) ... [2024-10-11 17:41:33,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:41:34,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:34,445 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-11 17:41:34,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@510bda1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:34, skipping insertion in model container [2024-10-11 17:41:34,447 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:34,447 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 17:41:34,449 INFO L158 Benchmark]: Toolchain (without parser) took 634.88ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 100.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:41:34,449 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:41:34,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.70ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 100.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 17:41:34,451 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.17ms. Allocated memory is still 100.7MB. Free memory is still 72.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 630.70ms. Allocated memory is still 159.4MB. Free memory was 121.9MB in the beginning and 100.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:41:36,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:41:36,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-11 17:41:36,488 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:41:36,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:41:36,514 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:41:36,515 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:41:36,515 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:41:36,516 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:41:36,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:41:36,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:41:36,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:41:36,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:41:36,521 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:41:36,521 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:41:36,523 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:41:36,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:41:36,524 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:41:36,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:41:36,524 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:41:36,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:41:36,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:41:36,525 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:41:36,525 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:41:36,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:41:36,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:41:36,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:41:36,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 17:41:36,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:41:36,527 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 17:41:36,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:41:36,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:41:36,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:41:36,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:41:36,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:41:36,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:41:36,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:41:36,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:41:36,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:41:36,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:41:36,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:41:36,536 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 17:41:36,536 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 17:41:36,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:41:36,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:41:36,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:41:36,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:41:36,537 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 17:41:36,537 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/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-clean/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 -> 69d24e9affd7540aafb8052ecd737d7732ca2a63c7e8e16adc4217413d1d99a5 [2024-10-11 17:41:36,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:41:36,877 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:41:36,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:41:36,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:41:36,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:41:36,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-10-11 17:41:38,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:41:38,602 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:41:38,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-1.i [2024-10-11 17:41:38,620 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6486c4b0a/1fbe69d17cea4526905b018d69ae1c8e/FLAGc4096d38a [2024-10-11 17:41:38,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6486c4b0a/1fbe69d17cea4526905b018d69ae1c8e [2024-10-11 17:41:38,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:41:38,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:41:38,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:38,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:41:38,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:41:38,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:38" (1/1) ... [2024-10-11 17:41:38,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d41e0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:38, skipping insertion in model container [2024-10-11 17:41:38,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:41:38" (1/1) ... [2024-10-11 17:41:38,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:41:39,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:39,559 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 17:41:39,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:41:39,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:39,654 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:41:39,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:41:39,811 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:41:39,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39 WrapperNode [2024-10-11 17:41:39,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:41:39,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:41:39,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:41:39,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:41:39,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:39,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:39,903 INFO L138 Inliner]: procedures = 211, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 905 [2024-10-11 17:41:39,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:41:39,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:41:39,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:41:39,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:41:39,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:39,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:39,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:39,998 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 172, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-10-11 17:41:39,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:39,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:40,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:40,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:40,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:40,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:40,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:41:40,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:41:40,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:41:40,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:41:40,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (1/1) ... [2024-10-11 17:41:40,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:41:40,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:41:40,112 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:41:40,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:41:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-11 17:41:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-11 17:41:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 17:41:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 17:41:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 17:41:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 17:41:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 17:41:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 17:41:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:41:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:41:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:41:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:41:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:41:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 17:41:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 17:41:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 17:41:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 17:41:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 17:41:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 17:41:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 17:41:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 17:41:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:41:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:41:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:41:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:41:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:41:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:41:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:41:40,382 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:41:40,384 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:41:48,343 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-10-11 17:41:48,343 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:41:48,377 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:41:48,377 INFO L314 CfgBuilder]: Removed 54 assume(true) statements. [2024-10-11 17:41:48,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:41:48 BoogieIcfgContainer [2024-10-11 17:41:48,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:41:48,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:41:48,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:41:48,386 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:41:48,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:41:38" (1/3) ... [2024-10-11 17:41:48,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79756da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:41:48, skipping insertion in model container [2024-10-11 17:41:48,387 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:41:39" (2/3) ... [2024-10-11 17:41:48,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79756da4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:41:48, skipping insertion in model container [2024-10-11 17:41:48,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:41:48" (3/3) ... [2024-10-11 17:41:48,389 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-1.i [2024-10-11 17:41:48,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:41:48,402 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 17:41:48,453 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:41:48,461 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;@37a4f448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:41:48,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 17:41:48,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 166 states have (on average 1.680722891566265) internal successors, (279), 175 states have internal predecessors, (279), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 17:41:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:41:48,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:48,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:41:48,473 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:48,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:48,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1644530680, now seen corresponding path program 1 times [2024-10-11 17:41:48,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:48,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927396382] [2024-10-11 17:41:48,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:48,493 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-11 17:41:48,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:48,497 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:48,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:48,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 17:41:48,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:48,682 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-11 17:41:48,682 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:48,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927396382] [2024-10-11 17:41:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927396382] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:48,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:41:48,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587690949] [2024-10-11 17:41:48,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 17:41:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 17:41:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:41:48,721 INFO L87 Difference]: Start difference. First operand has 182 states, 166 states have (on average 1.680722891566265) internal successors, (279), 175 states have internal predecessors, (279), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:41:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:48,813 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2024-10-11 17:41:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 17:41:48,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 17:41:48,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:48,825 INFO L225 Difference]: With dead ends: 180 [2024-10-11 17:41:48,826 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 17:41:48,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 17:41:48,831 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:48,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:41:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 17:41:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-11 17:41:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 172 states have internal predecessors, (217), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:41:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 235 transitions. [2024-10-11 17:41:48,891 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 235 transitions. Word has length 6 [2024-10-11 17:41:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:48,892 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 235 transitions. [2024-10-11 17:41:48,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:41:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 235 transitions. [2024-10-11 17:41:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:41:48,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:48,893 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:41:48,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:49,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:49,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:49,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:49,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1638208640, now seen corresponding path program 1 times [2024-10-11 17:41:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247387282] [2024-10-11 17:41:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:49,101 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-11 17:41:49,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:49,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:49,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:49,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:41:49,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:49,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:41:49,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:41:49,312 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:41:49,326 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-11 17:41:49,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:41:49,423 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-11 17:41:49,453 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-11 17:41:49,453 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:49,453 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:49,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247387282] [2024-10-11 17:41:49,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247387282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:49,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:49,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:41:49,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252786624] [2024-10-11 17:41:49,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:41:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:49,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:41:49,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:41:49,456 INFO L87 Difference]: Start difference. First operand 179 states and 235 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11 17:41:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:50,065 INFO L93 Difference]: Finished difference Result 343 states and 456 transitions. [2024-10-11 17:41:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:41:50,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-10-11 17:41:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:50,072 INFO L225 Difference]: With dead ends: 343 [2024-10-11 17:41:50,072 INFO L226 Difference]: Without dead ends: 343 [2024-10-11 17:41:50,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:41:50,075 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 201 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:50,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 684 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:41:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-11 17:41:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 181. [2024-10-11 17:41:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.311377245508982) internal successors, (219), 174 states have internal predecessors, (219), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:41:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 237 transitions. [2024-10-11 17:41:50,108 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 237 transitions. Word has length 8 [2024-10-11 17:41:50,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:50,109 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 237 transitions. [2024-10-11 17:41:50,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-11 17:41:50,109 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 237 transitions. [2024-10-11 17:41:50,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 17:41:50,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:50,111 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:41:50,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:50,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:50,312 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:50,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:50,312 INFO L85 PathProgramCache]: Analyzing trace with hash 988580530, now seen corresponding path program 1 times [2024-10-11 17:41:50,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:50,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266320285] [2024-10-11 17:41:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:50,314 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-11 17:41:50,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:50,317 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:50,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:50,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:41:50,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:41:50,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:50,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266320285] [2024-10-11 17:41:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266320285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:41:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570365140] [2024-10-11 17:41:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:41:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:41:50,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:41:50,748 INFO L87 Difference]: Start difference. First operand 181 states and 237 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-11 17:41:50,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:50,882 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2024-10-11 17:41:50,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:41:50,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-10-11 17:41:50,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:50,884 INFO L225 Difference]: With dead ends: 184 [2024-10-11 17:41:50,884 INFO L226 Difference]: Without dead ends: 184 [2024-10-11 17:41:50,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-11 17:41:50,885 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 30 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:50,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 589 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:41:50,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-11 17:41:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2024-10-11 17:41:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 170 states have (on average 1.2588235294117647) internal successors, (214), 177 states have internal predecessors, (214), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 17:41:50,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 232 transitions. [2024-10-11 17:41:50,894 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 232 transitions. Word has length 64 [2024-10-11 17:41:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:50,895 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 232 transitions. [2024-10-11 17:41:50,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-11 17:41:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2024-10-11 17:41:50,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 17:41:50,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:50,900 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:41:50,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 17:41:51,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:51,101 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:51,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1552494042, now seen corresponding path program 1 times [2024-10-11 17:41:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419108649] [2024-10-11 17:41:51,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:51,103 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-11 17:41:51,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:51,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:51,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:51,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:41:51,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:51,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:41:51,736 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:51,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419108649] [2024-10-11 17:41:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419108649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:51,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:51,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:41:51,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37800904] [2024-10-11 17:41:51,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:51,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:41:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:51,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:41:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:41:51,738 INFO L87 Difference]: Start difference. First operand 184 states and 232 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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-11 17:41:52,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:52,226 INFO L93 Difference]: Finished difference Result 285 states and 360 transitions. [2024-10-11 17:41:52,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:41:52,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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 64 [2024-10-11 17:41:52,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:52,229 INFO L225 Difference]: With dead ends: 285 [2024-10-11 17:41:52,229 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 17:41:52,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-11 17:41:52,230 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 74 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:52,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 482 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:41:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 17:41:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 281. [2024-10-11 17:41:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 262 states have (on average 1.2557251908396947) internal successors, (329), 274 states have internal predecessors, (329), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 17:41:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 357 transitions. [2024-10-11 17:41:52,242 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 357 transitions. Word has length 64 [2024-10-11 17:41:52,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:52,242 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 357 transitions. [2024-10-11 17:41:52,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 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-11 17:41:52,242 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 357 transitions. [2024-10-11 17:41:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 17:41:52,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:52,244 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] [2024-10-11 17:41:52,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:52,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:52,445 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:52,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1713846167, now seen corresponding path program 1 times [2024-10-11 17:41:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:52,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800643159] [2024-10-11 17:41:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:52,447 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-11 17:41:52,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:52,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:52,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:52,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:41:52,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:52,970 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-11 17:41:52,970 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:52,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800643159] [2024-10-11 17:41:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800643159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:52,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:41:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632502952] [2024-10-11 17:41:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:52,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:41:52,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:52,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:41:52,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:41:52,975 INFO L87 Difference]: Start difference. First operand 281 states and 357 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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-11 17:41:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:53,081 INFO L93 Difference]: Finished difference Result 283 states and 360 transitions. [2024-10-11 17:41:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:41:53,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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 77 [2024-10-11 17:41:53,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:53,085 INFO L225 Difference]: With dead ends: 283 [2024-10-11 17:41:53,085 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 17:41:53,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 74 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-11 17:41:53,086 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:53,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 653 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:41:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 17:41:53,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2024-10-11 17:41:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 263 states have (on average 1.258555133079848) internal successors, (331), 276 states have internal predecessors, (331), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:41:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 360 transitions. [2024-10-11 17:41:53,104 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 360 transitions. Word has length 77 [2024-10-11 17:41:53,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:53,104 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 360 transitions. [2024-10-11 17:41:53,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 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-11 17:41:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 360 transitions. [2024-10-11 17:41:53,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 17:41:53,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:53,107 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] [2024-10-11 17:41:53,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:53,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:53,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:53,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:53,308 INFO L85 PathProgramCache]: Analyzing trace with hash -271620439, now seen corresponding path program 1 times [2024-10-11 17:41:53,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:53,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878339058] [2024-10-11 17:41:53,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:53,309 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-11 17:41:53,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:53,312 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:53,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:53,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:41:53,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:53,818 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-11 17:41:53,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:41:53,917 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-11 17:41:53,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878339058] [2024-10-11 17:41:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878339058] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:41:53,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:41:53,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 17:41:53,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942604963] [2024-10-11 17:41:53,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:41:53,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:41:53,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:53,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:41:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:41:53,920 INFO L87 Difference]: Start difference. First operand 283 states and 360 transitions. Second operand has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 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-11 17:41:54,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:54,133 INFO L93 Difference]: Finished difference Result 292 states and 374 transitions. [2024-10-11 17:41:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:41:54,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 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 79 [2024-10-11 17:41:54,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:54,136 INFO L225 Difference]: With dead ends: 292 [2024-10-11 17:41:54,136 INFO L226 Difference]: Without dead ends: 292 [2024-10-11 17:41:54,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 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-11 17:41:54,137 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 4 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:54,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 654 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:41:54,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-10-11 17:41:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2024-10-11 17:41:54,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 270 states have (on average 1.2740740740740741) internal successors, (344), 283 states have internal predecessors, (344), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:41:54,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 373 transitions. [2024-10-11 17:41:54,151 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 373 transitions. Word has length 79 [2024-10-11 17:41:54,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 373 transitions. [2024-10-11 17:41:54,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.5) internal successors, (81), 8 states have internal predecessors, (81), 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-11 17:41:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 373 transitions. [2024-10-11 17:41:54,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 17:41:54,155 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:54,155 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] [2024-10-11 17:41:54,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-11 17:41:54,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:54,356 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:54,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:54,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1467668681, now seen corresponding path program 2 times [2024-10-11 17:41:54,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:54,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [607487441] [2024-10-11 17:41:54,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:41:54,358 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-11 17:41:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:54,360 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:54,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:54,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:41:54,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:41:54,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:41:54,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:54,668 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:41:54,669 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:41:54,670 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:41:54,672 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-11 17:41:54,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:41:54,731 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-11 17:41:54,747 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-11 17:41:54,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:54,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:54,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [607487441] [2024-10-11 17:41:54,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [607487441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:54,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:54,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:41:54,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171928036] [2024-10-11 17:41:54,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:54,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:41:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:54,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:41:54,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:41:54,751 INFO L87 Difference]: Start difference. First operand 291 states and 373 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-11 17:41:55,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:55,140 INFO L93 Difference]: Finished difference Result 427 states and 564 transitions. [2024-10-11 17:41:55,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:41:55,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 83 [2024-10-11 17:41:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:55,145 INFO L225 Difference]: With dead ends: 427 [2024-10-11 17:41:55,145 INFO L226 Difference]: Without dead ends: 427 [2024-10-11 17:41:55,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:41:55,146 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 186 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:55,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 597 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:41:55,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-11 17:41:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 293. [2024-10-11 17:41:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 272 states have (on average 1.2720588235294117) internal successors, (346), 285 states have internal predecessors, (346), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:41:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 375 transitions. [2024-10-11 17:41:55,164 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 375 transitions. Word has length 83 [2024-10-11 17:41:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:55,164 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 375 transitions. [2024-10-11 17:41:55,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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-11 17:41:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 375 transitions. [2024-10-11 17:41:55,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 17:41:55,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:55,170 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:41:55,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-11 17:41:55,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:55,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:55,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1655733047, now seen corresponding path program 1 times [2024-10-11 17:41:55,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:55,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282754958] [2024-10-11 17:41:55,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:55,375 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-11 17:41:55,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:55,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:55,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:55,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 17:41:55,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 17:41:55,995 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:41:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 17:41:56,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:56,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282754958] [2024-10-11 17:41:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282754958] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:41:56,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:41:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 17:41:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700502754] [2024-10-11 17:41:56,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:41:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 17:41:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:56,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 17:41:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:41:56,165 INFO L87 Difference]: Start difference. First operand 293 states and 375 transitions. Second operand has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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-11 17:41:56,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:56,649 INFO L93 Difference]: Finished difference Result 305 states and 394 transitions. [2024-10-11 17:41:56,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:41:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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 122 [2024-10-11 17:41:56,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:56,651 INFO L225 Difference]: With dead ends: 305 [2024-10-11 17:41:56,651 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 17:41:56,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 230 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-11 17:41:56,652 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 8 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:56,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1301 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:41:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 17:41:56,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2024-10-11 17:41:56,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2740213523131672) internal successors, (358), 294 states have internal predecessors, (358), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:41:56,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 387 transitions. [2024-10-11 17:41:56,660 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 387 transitions. Word has length 122 [2024-10-11 17:41:56,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:56,660 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 387 transitions. [2024-10-11 17:41:56,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.416666666666666) internal successors, (125), 14 states have internal predecessors, (125), 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-11 17:41:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 387 transitions. [2024-10-11 17:41:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 17:41:56,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:56,662 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] [2024-10-11 17:41:56,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:56,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:56,863 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 404247134, now seen corresponding path program 2 times [2024-10-11 17:41:56,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66392587] [2024-10-11 17:41:56,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:41:56,865 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-11 17:41:56,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:56,866 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:56,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:57,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:41:57,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:41:57,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:41:57,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-10-11 17:41:57,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:41:57,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:57,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66392587] [2024-10-11 17:41:57,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66392587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:41:57,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:41:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:41:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641056297] [2024-10-11 17:41:57,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:41:57,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:41:57,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:41:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:41:57,188 INFO L87 Difference]: Start difference. First operand 302 states and 387 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-11 17:41:57,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:41:57,315 INFO L93 Difference]: Finished difference Result 308 states and 377 transitions. [2024-10-11 17:41:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:41:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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 131 [2024-10-11 17:41:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:41:57,317 INFO L225 Difference]: With dead ends: 308 [2024-10-11 17:41:57,318 INFO L226 Difference]: Without dead ends: 308 [2024-10-11 17:41:57,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 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-11 17:41:57,318 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 30 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:41:57,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 556 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:41:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-11 17:41:57,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-10-11 17:41:57,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 287 states have (on average 1.2125435540069687) internal successors, (348), 300 states have internal predecessors, (348), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:41:57,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 377 transitions. [2024-10-11 17:41:57,326 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 377 transitions. Word has length 131 [2024-10-11 17:41:57,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:41:57,327 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 377 transitions. [2024-10-11 17:41:57,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 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-11 17:41:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 377 transitions. [2024-10-11 17:41:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 17:41:57,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:41:57,328 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] [2024-10-11 17:41:57,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 17:41:57,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:57,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:41:57,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:41:57,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1754176978, now seen corresponding path program 1 times [2024-10-11 17:41:57,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:41:57,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021959493] [2024-10-11 17:41:57,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:41:57,530 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-11 17:41:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:41:57,531 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:57,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:41:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:41:58,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 17:41:58,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:41:58,236 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-11 17:41:58,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:41:58,834 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-11 17:41:58,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:41:58,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021959493] [2024-10-11 17:41:58,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021959493] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:41:58,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:41:58,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-11 17:41:58,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188453857] [2024-10-11 17:41:58,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:41:58,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:41:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:41:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:41:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-11 17:41:58,838 INFO L87 Difference]: Start difference. First operand 308 states and 377 transitions. Second operand has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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-11 17:42:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:00,426 INFO L93 Difference]: Finished difference Result 329 states and 414 transitions. [2024-10-11 17:42:00,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-11 17:42:00,429 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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 131 [2024-10-11 17:42:00,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:00,431 INFO L225 Difference]: With dead ends: 329 [2024-10-11 17:42:00,432 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 17:42:00,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 17:42:00,434 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 14 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:00,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2669 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 17:42:00,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 17:42:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 326. [2024-10-11 17:42:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.219672131147541) internal successors, (372), 318 states have internal predecessors, (372), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:42:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 401 transitions. [2024-10-11 17:42:00,445 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 401 transitions. Word has length 131 [2024-10-11 17:42:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:00,445 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 401 transitions. [2024-10-11 17:42:00,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.708333333333333) internal successors, (137), 26 states have internal predecessors, (137), 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-11 17:42:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 401 transitions. [2024-10-11 17:42:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 17:42:00,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:00,448 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] [2024-10-11 17:42:00,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:00,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:00,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:00,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:00,649 INFO L85 PathProgramCache]: Analyzing trace with hash 776449202, now seen corresponding path program 2 times [2024-10-11 17:42:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:00,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527255700] [2024-10-11 17:42:00,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:42:00,650 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-11 17:42:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:00,652 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:01,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:42:01,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:42:01,023 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 17:42:01,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:01,044 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-11 17:42:01,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:01,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:01,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527255700] [2024-10-11 17:42:01,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527255700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:01,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:01,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:42:01,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932194083] [2024-10-11 17:42:01,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:01,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:42:01,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:01,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:42:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:42:01,047 INFO L87 Difference]: Start difference. First operand 326 states and 401 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-11 17:42:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:01,127 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2024-10-11 17:42:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:42:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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 149 [2024-10-11 17:42:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:01,129 INFO L225 Difference]: With dead ends: 326 [2024-10-11 17:42:01,130 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 17:42:01,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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-11 17:42:01,131 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:01,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:42:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 17:42:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-10-11 17:42:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.2) internal successors, (366), 318 states have internal predecessors, (366), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:42:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 395 transitions. [2024-10-11 17:42:01,139 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 395 transitions. Word has length 149 [2024-10-11 17:42:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 395 transitions. [2024-10-11 17:42:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 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-11 17:42:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 395 transitions. [2024-10-11 17:42:01,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-11 17:42:01,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:01,142 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] [2024-10-11 17:42:01,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:01,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:01,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:01,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1797517556, now seen corresponding path program 1 times [2024-10-11 17:42:01,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:01,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686176500] [2024-10-11 17:42:01,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:01,349 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-11 17:42:01,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:01,352 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:01,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:02,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:42:02,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:02,481 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-11 17:42:02,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:42:03,987 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-11 17:42:03,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686176500] [2024-10-11 17:42:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1686176500] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:42:03,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:42:03,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-11 17:42:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094675712] [2024-10-11 17:42:03,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:42:03,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-11 17:42:03,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:03,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-11 17:42:03,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-11 17:42:03,991 INFO L87 Difference]: Start difference. First operand 326 states and 395 transitions. Second operand has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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-11 17:42:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:09,721 INFO L93 Difference]: Finished difference Result 363 states and 464 transitions. [2024-10-11 17:42:09,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-11 17:42:09,722 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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 149 [2024-10-11 17:42:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:09,724 INFO L225 Difference]: With dead ends: 363 [2024-10-11 17:42:09,724 INFO L226 Difference]: Without dead ends: 361 [2024-10-11 17:42:09,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-11 17:42:09,728 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 26 mSDsluCounter, 4922 mSDsCounter, 0 mSdLazyCounter, 1983 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5130 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:09,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5130 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1983 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 17:42:09,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-10-11 17:42:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 360. [2024-10-11 17:42:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.2153392330383481) internal successors, (412), 352 states have internal predecessors, (412), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:42:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 441 transitions. [2024-10-11 17:42:09,737 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 441 transitions. Word has length 149 [2024-10-11 17:42:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:09,738 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 441 transitions. [2024-10-11 17:42:09,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.3541666666666665) internal successors, (161), 50 states have internal predecessors, (161), 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-11 17:42:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 441 transitions. [2024-10-11 17:42:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 17:42:09,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:09,740 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] [2024-10-11 17:42:09,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-11 17:42:09,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:09,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:09,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2011147156, now seen corresponding path program 2 times [2024-10-11 17:42:09,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:09,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347584293] [2024-10-11 17:42:09,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:42:09,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 17:42:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:09,943 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:09,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:11,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:42:11,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:42:11,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 1272 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 17:42:11,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:11,595 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-11 17:42:11,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:42:13,450 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-11 17:42:13,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:13,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347584293] [2024-10-11 17:42:13,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347584293] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:42:13,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:42:13,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-11 17:42:13,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142546236] [2024-10-11 17:42:13,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:42:13,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 17:42:13,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:13,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 17:42:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 17:42:13,455 INFO L87 Difference]: Start difference. First operand 360 states and 441 transitions. Second operand has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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-11 17:42:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:20,109 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2024-10-11 17:42:20,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-11 17:42:20,110 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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 183 [2024-10-11 17:42:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:20,112 INFO L225 Difference]: With dead ends: 387 [2024-10-11 17:42:20,112 INFO L226 Difference]: Without dead ends: 387 [2024-10-11 17:42:20,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-11 17:42:20,115 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 27 mSDsluCounter, 5103 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5310 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:20,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5310 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 17:42:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-10-11 17:42:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2024-10-11 17:42:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 364 states have (on average 1.2692307692307692) internal successors, (462), 377 states have internal predecessors, (462), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-10-11 17:42:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 491 transitions. [2024-10-11 17:42:20,123 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 491 transitions. Word has length 183 [2024-10-11 17:42:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 491 transitions. [2024-10-11 17:42:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.2) internal successors, (160), 52 states have internal predecessors, (160), 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-11 17:42:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 491 transitions. [2024-10-11 17:42:20,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-11 17:42:20,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:20,126 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] [2024-10-11 17:42:20,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 17:42:20,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:20,327 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:20,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:20,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1073622433, now seen corresponding path program 3 times [2024-10-11 17:42:20,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:20,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244349501] [2024-10-11 17:42:20,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:42:20,330 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-11 17:42:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:20,334 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:20,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:20,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:42:20,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:42:20,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 17:42:20,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:21,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4375 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4373 trivial. 0 not checked. [2024-10-11 17:42:21,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:42:21,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244349501] [2024-10-11 17:42:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244349501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:42:21,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:42:21,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:42:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006782261] [2024-10-11 17:42:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:42:21,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:42:21,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:21,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:42:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:42:21,252 INFO L87 Difference]: Start difference. First operand 385 states and 491 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-11 17:42:25,485 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-11 17:42:29,496 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-11 17:42:31,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 17:42:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:42:31,694 INFO L93 Difference]: Finished difference Result 327 states and 418 transitions. [2024-10-11 17:42:31,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:42:31,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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 208 [2024-10-11 17:42:31,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:42:31,695 INFO L225 Difference]: With dead ends: 327 [2024-10-11 17:42:31,695 INFO L226 Difference]: Without dead ends: 327 [2024-10-11 17:42:31,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 206 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-11 17:42:31,696 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 263 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:42:31,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 289 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 53 Invalid, 2 Unknown, 0 Unchecked, 10.4s Time] [2024-10-11 17:42:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-10-11 17:42:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2024-10-11 17:42:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 311 states have (on average 1.2829581993569132) internal successors, (399), 319 states have internal predecessors, (399), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-11 17:42:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 418 transitions. [2024-10-11 17:42:31,703 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 418 transitions. Word has length 208 [2024-10-11 17:42:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:42:31,703 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 418 transitions. [2024-10-11 17:42:31,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 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-11 17:42:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 418 transitions. [2024-10-11 17:42:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 17:42:31,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:42:31,706 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-11 17:42:31,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-11 17:42:31,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:31,906 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-11 17:42:31,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:42:31,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1256317993, now seen corresponding path program 1 times [2024-10-11 17:42:31,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 17:42:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608858005] [2024-10-11 17:42:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:42:31,908 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-11 17:42:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 17:42:31,909 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:31,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 17:42:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:42:33,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-11 17:42:33,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:42:35,459 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-11 17:42:35,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:42:43,069 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-11 17:42:43,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 17:42:43,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608858005] [2024-10-11 17:42:43,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608858005] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:42:43,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 17:42:43,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-11 17:42:43,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559616576] [2024-10-11 17:42:43,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 17:42:43,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-11 17:42:43,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 17:42:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-11 17:42:43,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-11 17:42:43,075 INFO L87 Difference]: Start difference. First operand 327 states and 418 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)