./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:21:50,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:21:50,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-13 10:21:50,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:21:50,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:21:50,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:21:50,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:21:50,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:21:50,497 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:21:50,498 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:21:50,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:21:50,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:21:50,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:21:50,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:21:50,501 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:21:50,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:21:50,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:21:50,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:21:50,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:21:50,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:21:50,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:21:50,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:21:50,508 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:21:50,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:21:50,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:21:50,508 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:21:50,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:21:50,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:21:50,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:21:50,510 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:21:50,510 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:21:50,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:21:50,510 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:21:50,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:21:50,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:21:50,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:21:50,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:21:50,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:21:50,513 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:21:50,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:21:50,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:21:50,514 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:21:50,514 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:21:50,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:21:50,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:21:50,515 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-10-13 10:21:50,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:21:50,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:21:50,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:21:50,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:21:50,811 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:21:50,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-10-13 10:21:52,335 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:21:52,673 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:21:52,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-10-13 10:21:52,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1075afdcf/b3505f9f05d94ad38ca24e4d85658744/FLAGcde0aa662 [2024-10-13 10:21:52,715 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1075afdcf/b3505f9f05d94ad38ca24e4d85658744 [2024-10-13 10:21:52,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:21:52,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:21:52,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:21:52,724 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:21:52,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:21:52,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:21:52" (1/1) ... [2024-10-13 10:21:52,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b8d3e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:52, skipping insertion in model container [2024-10-13 10:21:52,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:21:52" (1/1) ... [2024-10-13 10:21:52,798 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:21:53,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:21:53,433 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 10:21:53,434 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d65a1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:53, skipping insertion in model container [2024-10-13 10:21:53,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:21:53,435 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 10:21:53,437 INFO L158 Benchmark]: Toolchain (without parser) took 714.93ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 74.0MB in the beginning and 161.7MB in the end (delta: -87.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-13 10:21:53,438 INFO L158 Benchmark]: CDTParser took 1.01ms. Allocated memory is still 151.0MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:21:53,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 711.93ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 73.8MB in the beginning and 162.7MB in the end (delta: -88.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-13 10:21:53,440 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.01ms. Allocated memory is still 151.0MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 711.93ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 73.8MB in the beginning and 162.7MB in the end (delta: -88.9MB). Peak memory consumption was 17.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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:21:55,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:21:55,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-13 10:21:55,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:21:55,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:21:55,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:21:55,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:21:55,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:21:55,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:21:55,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:21:55,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:21:55,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:21:55,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:21:55,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:21:55,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:21:55,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:21:55,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:21:55,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:21:55,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:21:55,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:21:55,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:21:55,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:21:55,604 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:21:55,605 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:21:55,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:21:55,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:21:55,606 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:21:55,606 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 10:21:55,606 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:21:55,607 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 10:21:55,607 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:21:55,607 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:21:55,607 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:21:55,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:21:55,608 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:21:55,608 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:21:55,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:21:55,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:21:55,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:21:55,609 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:21:55,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:21:55,610 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 10:21:55,610 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 10:21:55,611 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:21:55,611 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:21:55,611 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:21:55,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:21:55,611 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 10:21:55,612 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d619c50f205026415119876db06c9bf079f51316bee7c051af8e3a06a37e393d [2024-10-13 10:21:55,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:21:55,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:21:55,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:21:55,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:21:55,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:21:55,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-10-13 10:21:57,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:21:57,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:21:57,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-2.i [2024-10-13 10:21:57,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f3ba503/2caa6f7044be4e66a03eab4163aa1e65/FLAG561f6955a [2024-10-13 10:21:58,071 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4f3ba503/2caa6f7044be4e66a03eab4163aa1e65 [2024-10-13 10:21:58,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:21:58,075 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:21:58,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:21:58,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:21:58,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:21:58,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:58,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f03bb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58, skipping insertion in model container [2024-10-13 10:21:58,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:58,148 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:21:58,679 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:21:58,697 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 10:21:58,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:21:58,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:21:58,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:21:58,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:21:58,950 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:21:58,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58 WrapperNode [2024-10-13 10:21:58,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:21:58,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:21:58,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:21:58,953 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:21:58,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,002 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,083 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1063 [2024-10-13 10:21:59,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:21:59,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:21:59,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:21:59,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:21:59,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,202 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 220, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-10-13 10:21:59,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,273 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:21:59,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:21:59,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:21:59,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:21:59,279 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (1/1) ... [2024-10-13 10:21:59,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:21:59,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:21:59,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:21:59,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-13 10:21:59,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 10:21:59,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 10:21:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 10:21:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 10:21:59,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 10:21:59,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 10:21:59,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 10:21:59,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 10:21:59,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 10:21:59,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 10:21:59,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:21:59,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:21:59,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:21:59,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:22:07,202 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-10-13 10:22:07,203 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:22:07,248 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:22:07,249 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-13 10:22:07,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:22:07 BoogieIcfgContainer [2024-10-13 10:22:07,250 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:22:07,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:22:07,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:22:07,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:22:07,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:21:58" (1/3) ... [2024-10-13 10:22:07,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27363b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:22:07, skipping insertion in model container [2024-10-13 10:22:07,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:21:58" (2/3) ... [2024-10-13 10:22:07,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27363b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:22:07, skipping insertion in model container [2024-10-13 10:22:07,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:22:07" (3/3) ... [2024-10-13 10:22:07,259 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-2.i [2024-10-13 10:22:07,277 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:22:07,278 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 10:22:07,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:22:07,345 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;@4a759c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:22:07,345 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-13 10:22:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 212 states, 196 states have (on average 1.6785714285714286) internal successors, (329), 205 states have internal predecessors, (329), 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-13 10:22:07,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:22:07,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:07,361 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:07,361 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:07,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2100239337, now seen corresponding path program 1 times [2024-10-13 10:22:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:07,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1549233421] [2024-10-13 10:22:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:07,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:07,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:07,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:07,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 10:22:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:07,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 10:22:07,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:22:07,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:07,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:07,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1549233421] [2024-10-13 10:22:07,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1549233421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:07,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:07,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:22:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371058225] [2024-10-13 10:22:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:07,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 10:22:07,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:07,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 10:22:07,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:22:07,646 INFO L87 Difference]: Start difference. First operand has 212 states, 196 states have (on average 1.6785714285714286) internal successors, (329), 205 states have internal predecessors, (329), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:22:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:07,733 INFO L93 Difference]: Finished difference Result 210 states and 277 transitions. [2024-10-13 10:22:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 10:22:07,735 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:22:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:07,744 INFO L225 Difference]: With dead ends: 210 [2024-10-13 10:22:07,744 INFO L226 Difference]: Without dead ends: 209 [2024-10-13 10:22:07,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 10:22:07,750 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:07,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:22:07,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-13 10:22:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2024-10-13 10:22:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 195 states have (on average 1.323076923076923) internal successors, (258), 202 states have internal predecessors, (258), 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-13 10:22:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 276 transitions. [2024-10-13 10:22:07,856 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 276 transitions. Word has length 10 [2024-10-13 10:22:07,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:07,858 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 276 transitions. [2024-10-13 10:22:07,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:22:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 276 transitions. [2024-10-13 10:22:07,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:22:07,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:07,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:07,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 10:22:08,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:08,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:08,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1047215673, now seen corresponding path program 1 times [2024-10-13 10:22:08,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:08,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78650427] [2024-10-13 10:22:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:08,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:08,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:08,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 10:22:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:08,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:22:08,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:22:08,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:08,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78650427] [2024-10-13 10:22:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78650427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:22:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775913947] [2024-10-13 10:22:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:22:08,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:22:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:22:08,392 INFO L87 Difference]: Start difference. First operand 209 states and 276 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:22:09,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:09,142 INFO L93 Difference]: Finished difference Result 339 states and 452 transitions. [2024-10-13 10:22:09,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:22:09,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:22:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:09,145 INFO L225 Difference]: With dead ends: 339 [2024-10-13 10:22:09,145 INFO L226 Difference]: Without dead ends: 339 [2024-10-13 10:22:09,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:22:09,147 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 156 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:09,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 507 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 10:22:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-13 10:22:09,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 308. [2024-10-13 10:22:09,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 289 states have (on average 1.328719723183391) internal successors, (384), 301 states have internal predecessors, (384), 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-13 10:22:09,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 412 transitions. [2024-10-13 10:22:09,173 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 412 transitions. Word has length 12 [2024-10-13 10:22:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:09,174 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 412 transitions. [2024-10-13 10:22:09,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:22:09,174 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 412 transitions. [2024-10-13 10:22:09,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:22:09,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:09,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:09,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 10:22:09,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:09,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:09,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1045368631, now seen corresponding path program 1 times [2024-10-13 10:22:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:09,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951566609] [2024-10-13 10:22:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:09,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:09,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 10:22:09,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:09,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:22:09,580 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:09,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:22:09,610 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:22:09,611 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:22:09,624 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-13 10:22:09,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:22:09,700 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-13 10:22:09,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:22:09,719 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:09,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951566609] [2024-10-13 10:22:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951566609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:09,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:22:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778921743] [2024-10-13 10:22:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:09,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:22:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:22:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:09,723 INFO L87 Difference]: Start difference. First operand 308 states and 412 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:22:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:10,240 INFO L93 Difference]: Finished difference Result 474 states and 643 transitions. [2024-10-13 10:22:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:22:10,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:22:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:10,246 INFO L225 Difference]: With dead ends: 474 [2024-10-13 10:22:10,247 INFO L226 Difference]: Without dead ends: 474 [2024-10-13 10:22:10,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-13 10:22:10,248 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 239 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:10,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 802 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 10:22:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-13 10:22:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2024-10-13 10:22:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 288 states have (on average 1.3263888888888888) internal successors, (382), 300 states have internal predecessors, (382), 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-13 10:22:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 410 transitions. [2024-10-13 10:22:10,271 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 410 transitions. Word has length 12 [2024-10-13 10:22:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:10,272 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 410 transitions. [2024-10-13 10:22:10,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:22:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 410 transitions. [2024-10-13 10:22:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 10:22:10,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:10,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:10,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 10:22:10,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:10,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:10,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -748185132, now seen corresponding path program 1 times [2024-10-13 10:22:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916781298] [2024-10-13 10:22:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:10,479 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:10,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:10,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:10,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 10:22:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:11,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:22:11,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:11,038 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-13 10:22:11,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:11,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916781298] [2024-10-13 10:22:11,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916781298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:11,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:11,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:22:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437076359] [2024-10-13 10:22:11,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:11,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:22:11,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:11,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:22:11,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:11,042 INFO L87 Difference]: Start difference. First operand 307 states and 410 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:11,212 INFO L93 Difference]: Finished difference Result 313 states and 400 transitions. [2024-10-13 10:22:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:22:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-10-13 10:22:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:11,216 INFO L225 Difference]: With dead ends: 313 [2024-10-13 10:22:11,216 INFO L226 Difference]: Without dead ends: 313 [2024-10-13 10:22:11,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:22:11,218 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:11,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 709 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:22:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-13 10:22:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2024-10-13 10:22:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 294 states have (on average 1.2653061224489797) internal successors, (372), 306 states have internal predecessors, (372), 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-13 10:22:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 400 transitions. [2024-10-13 10:22:11,233 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 400 transitions. Word has length 81 [2024-10-13 10:22:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:11,233 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 400 transitions. [2024-10-13 10:22:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 400 transitions. [2024-10-13 10:22:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-13 10:22:11,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:11,236 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:11,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 10:22:11,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:11,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:11,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -672225056, now seen corresponding path program 1 times [2024-10-13 10:22:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:11,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1728345782] [2024-10-13 10:22:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:11,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:11,442 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:11,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 10:22:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:11,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:22:11,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:11,967 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-13 10:22:11,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:11,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:11,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1728345782] [2024-10-13 10:22:11,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1728345782] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:11,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:11,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:22:11,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046819956] [2024-10-13 10:22:11,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:11,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:22:11,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:11,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:22:11,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:11,970 INFO L87 Difference]: Start difference. First operand 313 states and 400 transitions. Second operand has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:22:12,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:12,062 INFO L93 Difference]: Finished difference Result 315 states and 403 transitions. [2024-10-13 10:22:12,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:22:12,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2024-10-13 10:22:12,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:12,065 INFO L225 Difference]: With dead ends: 315 [2024-10-13 10:22:12,065 INFO L226 Difference]: Without dead ends: 315 [2024-10-13 10:22:12,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:12,066 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:12,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 773 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:22:12,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-13 10:22:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-10-13 10:22:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 295 states have (on average 1.2677966101694915) internal successors, (374), 308 states have internal predecessors, (374), 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-13 10:22:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 403 transitions. [2024-10-13 10:22:12,077 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 403 transitions. Word has length 81 [2024-10-13 10:22:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 403 transitions. [2024-10-13 10:22:12,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 25.666666666666668) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-13 10:22:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 403 transitions. [2024-10-13 10:22:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-13 10:22:12,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:12,080 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:12,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 10:22:12,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:12,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:12,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 808917780, now seen corresponding path program 1 times [2024-10-13 10:22:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:12,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908061270] [2024-10-13 10:22:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:12,283 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:12,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:12,284 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:12,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 10:22:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:12,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:22:12,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:12,805 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-13 10:22:12,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:22:12,951 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-13 10:22:12,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:12,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908061270] [2024-10-13 10:22:12,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [908061270] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:22:12,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:22:12,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-13 10:22:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282260155] [2024-10-13 10:22:12,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:22:12,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:22:12,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:22:12,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:22:12,956 INFO L87 Difference]: Start difference. First operand 315 states and 403 transitions. Second operand has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:13,211 INFO L93 Difference]: Finished difference Result 324 states and 417 transitions. [2024-10-13 10:22:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:22:13,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2024-10-13 10:22:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:13,215 INFO L225 Difference]: With dead ends: 324 [2024-10-13 10:22:13,215 INFO L226 Difference]: Without dead ends: 324 [2024-10-13 10:22:13,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-13 10:22:13,216 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 5 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:13,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1029 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:22:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-13 10:22:13,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 323. [2024-10-13 10:22:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 302 states have (on average 1.281456953642384) internal successors, (387), 315 states have internal predecessors, (387), 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-13 10:22:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 416 transitions. [2024-10-13 10:22:13,232 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 416 transitions. Word has length 83 [2024-10-13 10:22:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:13,232 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 416 transitions. [2024-10-13 10:22:13,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 14.166666666666666) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 416 transitions. [2024-10-13 10:22:13,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-13 10:22:13,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:13,235 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:13,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 10:22:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:13,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:13,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1964578816, now seen corresponding path program 2 times [2024-10-13 10:22:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537491741] [2024-10-13 10:22:13,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:22:13,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:13,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:13,438 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:13,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 10:22:13,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:22:13,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:22:13,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 10:22:13,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:13,759 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-13 10:22:13,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:13,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:13,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537491741] [2024-10-13 10:22:13,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537491741] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:13,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:13,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:22:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335508899] [2024-10-13 10:22:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:13,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:22:13,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:22:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:13,762 INFO L87 Difference]: Start difference. First operand 323 states and 416 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:18,028 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-13 10:22:22,037 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-13 10:22:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:24,083 INFO L93 Difference]: Finished difference Result 465 states and 610 transitions. [2024-10-13 10:22:24,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:22:24,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-10-13 10:22:24,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:24,086 INFO L225 Difference]: With dead ends: 465 [2024-10-13 10:22:24,087 INFO L226 Difference]: Without dead ends: 465 [2024-10-13 10:22:24,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:22:24,088 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 572 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 17 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:24,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 444 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2024-10-13 10:22:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-13 10:22:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 440. [2024-10-13 10:22:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 413 states have (on average 1.2929782082324455) internal successors, (534), 431 states have internal predecessors, (534), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 576 transitions. [2024-10-13 10:22:24,099 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 576 transitions. Word has length 87 [2024-10-13 10:22:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:24,100 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 576 transitions. [2024-10-13 10:22:24,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 576 transitions. [2024-10-13 10:22:24,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-13 10:22:24,101 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:24,102 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:24,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-13 10:22:24,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:24,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:24,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1592475478, now seen corresponding path program 1 times [2024-10-13 10:22:24,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:24,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997284372] [2024-10-13 10:22:24,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:24,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:24,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:24,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 10:22:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:24,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 10:22:24,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 10:22:24,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:22:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-13 10:22:25,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997284372] [2024-10-13 10:22:25,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997284372] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:22:25,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:22:25,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-13 10:22:25,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005426175] [2024-10-13 10:22:25,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:22:25,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 10:22:25,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:25,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 10:22:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-13 10:22:25,068 INFO L87 Difference]: Start difference. First operand 440 states and 576 transitions. Second operand has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:25,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:25,665 INFO L93 Difference]: Finished difference Result 452 states and 596 transitions. [2024-10-13 10:22:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:22:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-10-13 10:22:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:25,668 INFO L225 Difference]: With dead ends: 452 [2024-10-13 10:22:25,668 INFO L226 Difference]: Without dead ends: 450 [2024-10-13 10:22:25,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-13 10:22:25,669 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 7 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:25,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2561 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 10:22:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-13 10:22:25,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 449. [2024-10-13 10:22:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 422 states have (on average 1.2938388625592416) internal successors, (546), 440 states have internal predecessors, (546), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 588 transitions. [2024-10-13 10:22:25,679 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 588 transitions. Word has length 96 [2024-10-13 10:22:25,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:25,680 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 588 transitions. [2024-10-13 10:22:25,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.333333333333334) internal successors, (100), 14 states have internal predecessors, (100), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 588 transitions. [2024-10-13 10:22:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 10:22:25,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:25,681 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:25,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-10-13 10:22:25,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:25,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:25,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:25,883 INFO L85 PathProgramCache]: Analyzing trace with hash 2124401835, now seen corresponding path program 2 times [2024-10-13 10:22:25,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:25,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209457387] [2024-10-13 10:22:25,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:22:25,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:25,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:25,885 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:25,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 10:22:26,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:22:26,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:22:26,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 10:22:26,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:26,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:22:26,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:22:26,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 10:22:26,231 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-13 10:22:26,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:22:26,290 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-13 10:22:26,303 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-10-13 10:22:26,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:26,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209457387] [2024-10-13 10:22:26,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209457387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:26,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:26,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:22:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334901252] [2024-10-13 10:22:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:26,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:22:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:26,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:22:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:26,306 INFO L87 Difference]: Start difference. First operand 449 states and 588 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:26,679 INFO L93 Difference]: Finished difference Result 657 states and 880 transitions. [2024-10-13 10:22:26,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:22:26,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2024-10-13 10:22:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:26,684 INFO L225 Difference]: With dead ends: 657 [2024-10-13 10:22:26,684 INFO L226 Difference]: Without dead ends: 657 [2024-10-13 10:22:26,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:22:26,685 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 186 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:26,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 771 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 10:22:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-13 10:22:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 453. [2024-10-13 10:22:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 426 states have (on average 1.2910798122065728) internal successors, (550), 444 states have internal predecessors, (550), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:26,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 592 transitions. [2024-10-13 10:22:26,700 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 592 transitions. Word has length 105 [2024-10-13 10:22:26,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 592 transitions. [2024-10-13 10:22:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 592 transitions. [2024-10-13 10:22:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 10:22:26,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:26,702 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:26,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-13 10:22:26,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:26,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:26,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash -909563735, now seen corresponding path program 1 times [2024-10-13 10:22:26,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150823278] [2024-10-13 10:22:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:26,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:26,907 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:26,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 10:22:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:27,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 10:22:27,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:27,690 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-13 10:22:27,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:22:28,524 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-13 10:22:28,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:28,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150823278] [2024-10-13 10:22:28,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150823278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:22:28,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:22:28,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-13 10:22:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915253901] [2024-10-13 10:22:28,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:22:28,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 10:22:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:28,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 10:22:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-13 10:22:28,528 INFO L87 Difference]: Start difference. First operand 453 states and 592 transitions. Second operand has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:30,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:30,786 INFO L93 Difference]: Finished difference Result 474 states and 630 transitions. [2024-10-13 10:22:30,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-13 10:22:30,789 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-10-13 10:22:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:30,792 INFO L225 Difference]: With dead ends: 474 [2024-10-13 10:22:30,792 INFO L226 Difference]: Without dead ends: 472 [2024-10-13 10:22:30,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 10:22:30,793 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 14 mSDsluCounter, 3074 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3333 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:30,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3333 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 10:22:30,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-10-13 10:22:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 471. [2024-10-13 10:22:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 444 states have (on average 1.2927927927927927) internal successors, (574), 462 states have internal predecessors, (574), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:30,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 616 transitions. [2024-10-13 10:22:30,805 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 616 transitions. Word has length 139 [2024-10-13 10:22:30,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:30,806 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 616 transitions. [2024-10-13 10:22:30,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 6.041666666666667) internal successors, (145), 26 states have internal predecessors, (145), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:30,806 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 616 transitions. [2024-10-13 10:22:30,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 10:22:30,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:30,808 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:30,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-13 10:22:31,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:31,009 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:31,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:31,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1534461449, now seen corresponding path program 2 times [2024-10-13 10:22:31,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047276980] [2024-10-13 10:22:31,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:22:31,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:31,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:31,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:31,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 10:22:31,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:22:31,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:22:31,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 10:22:31,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:31,460 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-13 10:22:31,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:31,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:31,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047276980] [2024-10-13 10:22:31,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047276980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:31,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:31,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 10:22:31,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914446253] [2024-10-13 10:22:31,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:31,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:22:31,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:31,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:22:31,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:22:31,463 INFO L87 Difference]: Start difference. First operand 471 states and 616 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:31,607 INFO L93 Difference]: Finished difference Result 531 states and 676 transitions. [2024-10-13 10:22:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:22:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 157 [2024-10-13 10:22:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:31,610 INFO L225 Difference]: With dead ends: 531 [2024-10-13 10:22:31,610 INFO L226 Difference]: Without dead ends: 531 [2024-10-13 10:22:31,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:22:31,612 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 7 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:31,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 468 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:22:31,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-10-13 10:22:31,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 531. [2024-10-13 10:22:31,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 504 states have (on average 1.257936507936508) internal successors, (634), 522 states have internal predecessors, (634), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 676 transitions. [2024-10-13 10:22:31,624 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 676 transitions. Word has length 157 [2024-10-13 10:22:31,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:31,624 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 676 transitions. [2024-10-13 10:22:31,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:31,625 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 676 transitions. [2024-10-13 10:22:31,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-13 10:22:31,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:31,626 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:31,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 10:22:31,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:31,832 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:31,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1597133043, now seen corresponding path program 1 times [2024-10-13 10:22:31,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:31,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034292528] [2024-10-13 10:22:31,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:31,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:31,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:31,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:31,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 10:22:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:32,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-13 10:22:32,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:33,111 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-13 10:22:33,112 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:22:35,122 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-13 10:22:35,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034292528] [2024-10-13 10:22:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034292528] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:22:35,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:22:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 10:22:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029849525] [2024-10-13 10:22:35,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:22:35,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 10:22:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:35,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 10:22:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-13 10:22:35,126 INFO L87 Difference]: Start difference. First operand 531 states and 676 transitions. Second operand has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:41,792 INFO L93 Difference]: Finished difference Result 568 states and 746 transitions. [2024-10-13 10:22:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-13 10:22:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 157 [2024-10-13 10:22:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:41,796 INFO L225 Difference]: With dead ends: 568 [2024-10-13 10:22:41,796 INFO L226 Difference]: Without dead ends: 566 [2024-10-13 10:22:41,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-13 10:22:41,798 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 25 mSDsluCounter, 6655 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6914 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:41,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6914 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 10:22:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-13 10:22:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 565. [2024-10-13 10:22:41,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 538 states have (on average 1.2639405204460967) internal successors, (680), 556 states have internal predecessors, (680), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:41,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 722 transitions. [2024-10-13 10:22:41,810 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 722 transitions. Word has length 157 [2024-10-13 10:22:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:41,811 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 722 transitions. [2024-10-13 10:22:41,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 3.5208333333333335) internal successors, (169), 50 states have internal predecessors, (169), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-13 10:22:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 722 transitions. [2024-10-13 10:22:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 10:22:41,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:41,814 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:41,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-13 10:22:42,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:42,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:42,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash -546182419, now seen corresponding path program 2 times [2024-10-13 10:22:42,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:42,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776994764] [2024-10-13 10:22:42,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:22:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:42,024 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:42,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 10:22:42,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 10:22:42,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:22:42,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 10:22:42,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2350 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-10-13 10:22:42,489 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 10:22:42,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:42,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776994764] [2024-10-13 10:22:42,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776994764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:22:42,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:22:42,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:22:42,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618237786] [2024-10-13 10:22:42,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:22:42,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:22:42,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:42,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:22:42,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:22:42,492 INFO L87 Difference]: Start difference. First operand 565 states and 722 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:42,617 INFO L93 Difference]: Finished difference Result 514 states and 638 transitions. [2024-10-13 10:22:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:22:42,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 191 [2024-10-13 10:22:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:42,620 INFO L225 Difference]: With dead ends: 514 [2024-10-13 10:22:42,620 INFO L226 Difference]: Without dead ends: 514 [2024-10-13 10:22:42,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:22:42,621 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 32 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:42,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 672 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:22:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-10-13 10:22:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2024-10-13 10:22:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 487 states have (on average 1.2238193018480492) internal successors, (596), 505 states have internal predecessors, (596), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 638 transitions. [2024-10-13 10:22:42,631 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 638 transitions. Word has length 191 [2024-10-13 10:22:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:42,631 INFO L471 AbstractCegarLoop]: Abstraction has 514 states and 638 transitions. [2024-10-13 10:22:42,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-13 10:22:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 638 transitions. [2024-10-13 10:22:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 10:22:42,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:42,634 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:22:42,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 10:22:42,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:42,834 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:42,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:42,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1477753759, now seen corresponding path program 1 times [2024-10-13 10:22:42,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:42,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687186374] [2024-10-13 10:22:42,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:22:42,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:42,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:42,839 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:42,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 10:22:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:22:43,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:22:43,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:44,359 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-13 10:22:44,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:22:45,876 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-13 10:22:45,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:22:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687186374] [2024-10-13 10:22:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687186374] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:22:45,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:22:45,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-13 10:22:45,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678943995] [2024-10-13 10:22:45,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:22:45,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-13 10:22:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:22:45,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-13 10:22:45,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-13 10:22:45,880 INFO L87 Difference]: Start difference. First operand 514 states and 638 transitions. Second operand has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:22:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:22:51,819 INFO L93 Difference]: Finished difference Result 541 states and 692 transitions. [2024-10-13 10:22:51,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-13 10:22:51,820 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 191 [2024-10-13 10:22:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:22:51,822 INFO L225 Difference]: With dead ends: 541 [2024-10-13 10:22:51,822 INFO L226 Difference]: Without dead ends: 541 [2024-10-13 10:22:51,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-13 10:22:51,825 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 27 mSDsluCounter, 6838 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 7085 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:22:51,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 7085 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 10:22:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-10-13 10:22:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 539. [2024-10-13 10:22:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 512 states have (on average 1.26171875) internal successors, (646), 530 states have internal predecessors, (646), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-10-13 10:22:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 688 transitions. [2024-10-13 10:22:51,837 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 688 transitions. Word has length 191 [2024-10-13 10:22:51,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:22:51,838 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 688 transitions. [2024-10-13 10:22:51,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 3.36) internal successors, (168), 52 states have internal predecessors, (168), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-13 10:22:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 688 transitions. [2024-10-13 10:22:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-13 10:22:51,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:22:51,840 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-13 10:22:51,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 10:22:52,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:52,041 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-13 10:22:52,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:22:52,041 INFO L85 PathProgramCache]: Analyzing trace with hash -168717014, now seen corresponding path program 2 times [2024-10-13 10:22:52,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 10:22:52,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534267790] [2024-10-13 10:22:52,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:22:52,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 10:22:52,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 10:22:52,044 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 10:22:52,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 10:22:53,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:22:53,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:22:53,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:22:53,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:22:55,754 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-13 10:22:55,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:23:02,192 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-13 10:23:02,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 10:23:02,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534267790] [2024-10-13 10:23:02,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534267790] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:23:02,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 10:23:02,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-13 10:23:02,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578294280] [2024-10-13 10:23:02,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 10:23:02,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-13 10:23:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 10:23:02,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-13 10:23:02,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-13 10:23:02,198 INFO L87 Difference]: Start difference. First operand 539 states and 688 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)