./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:57:14,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:57:14,753 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-16 23:57:14,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:57:14,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:57:14,794 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:57:14,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:57:14,795 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:57:14,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:57:14,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:57:14,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:57:14,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:57:14,801 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:57:14,801 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:57:14,803 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:57:14,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:57:14,804 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:57:14,804 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:57:14,804 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:57:14,805 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:57:14,805 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:57:14,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:57:14,810 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:57:14,810 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:57:14,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:57:14,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:57:14,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:57:14,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:57:14,811 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:57:14,811 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:57:14,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:57:14,812 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:57:14,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:57:14,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:57:14,812 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:57:14,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:57:14,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:57:14,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:57:14,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:57:14,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:57:14,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:57:14,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:57:14,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:57:14,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:57:14,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:57:14,817 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 -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2024-11-16 23:57:15,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:57:15,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:57:15,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:57:15,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:57:15,134 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:57:15,136 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-16 23:57:16,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:57:16,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:57:16,910 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-16 23:57:16,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db207dc0/9fb19acd1d9c4675bd86bee17c243439/FLAGb97b50f7b [2024-11-16 23:57:17,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db207dc0/9fb19acd1d9c4675bd86bee17c243439 [2024-11-16 23:57:17,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:57:17,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:57:17,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:17,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:57:17,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:57:17,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:17" (1/1) ... [2024-11-16 23:57:17,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b6437e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:17, skipping insertion in model container [2024-11-16 23:57:17,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:17" (1/1) ... [2024-11-16 23:57:17,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:57:17,778 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,818 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,822 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,828 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,839 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,919 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,919 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,921 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,924 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,931 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,935 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,936 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,944 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:17,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:17,994 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-11-16 23:57:17,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@182c0eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:17, skipping insertion in model container [2024-11-16 23:57:17,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:17,998 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-16 23:57:17,999 INFO L158 Benchmark]: Toolchain (without parser) took 804.35ms. Allocated memory is still 182.5MB. Free memory was 112.4MB in the beginning and 150.3MB in the end (delta: -37.9MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-16 23:57:18,000 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:57:18,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 801.35ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 150.3MB in the end (delta: -38.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-16 23:57:18,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 801.35ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 150.3MB in the end (delta: -38.1MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 747]: 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/11.0.12-open/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 ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:57:20,197 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:57:20,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-16 23:57:20,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:57:20,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:57:20,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:57:20,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:57:20,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:57:20,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:57:20,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:57:20,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:57:20,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:57:20,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:57:20,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:57:20,328 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:57:20,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:57:20,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:57:20,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:57:20,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:57:20,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:57:20,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:57:20,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:57:20,333 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:57:20,334 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:57:20,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:57:20,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:57:20,335 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:57:20,335 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 23:57:20,335 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:57:20,335 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 23:57:20,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:57:20,336 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:57:20,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:57:20,336 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:57:20,336 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:57:20,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:57:20,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:57:20,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:57:20,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:57:20,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:57:20,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:57:20,339 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 23:57:20,340 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 23:57:20,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:57:20,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:57:20,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:57:20,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:57:20,341 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 -> eb2eb63835edf753d5a467feb7a4cdd6d105155177d7d0cab8bf29c1b74dbaf6 [2024-11-16 23:57:20,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:57:20,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:57:20,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:57:20,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:57:20,748 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:57:20,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-16 23:57:22,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:57:22,689 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:57:22,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test3-1.i [2024-11-16 23:57:22,711 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e0b2cb/d2c199160fbe45788bc3fc0a326b201d/FLAGd55328198 [2024-11-16 23:57:22,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e0b2cb/d2c199160fbe45788bc3fc0a326b201d [2024-11-16 23:57:22,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:57:22,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:57:22,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:22,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:57:22,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:57:22,939 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:22" (1/1) ... [2024-11-16 23:57:22,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@623f2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:22, skipping insertion in model container [2024-11-16 23:57:22,940 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:22" (1/1) ... [2024-11-16 23:57:23,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:57:23,466 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,500 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,503 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,508 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,519 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,555 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,555 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,563 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,564 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,570 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,570 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,575 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:23,614 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-16 23:57:23,645 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:57:23,685 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,704 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,709 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,713 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,718 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,747 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,750 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,753 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,754 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,757 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,757 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,759 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,760 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,766 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:23,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:23,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:57:23,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:23,929 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:57:23,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23 WrapperNode [2024-11-16 23:57:23,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:23,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:57:23,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:57:23,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:57:23,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:23,983 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,046 INFO L138 Inliner]: procedures = 180, calls = 279, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1015 [2024-11-16 23:57:24,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:57:24,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:57:24,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:57:24,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:57:24,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,161 INFO L175 MemorySlicer]: Split 255 memory accesses to 3 slices as follows [2, 34, 219]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-16 23:57:24,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,192 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:57:24,209 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:57:24,209 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:57:24,209 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:57:24,210 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (1/1) ... [2024-11-16 23:57:24,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:57:24,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:57:24,256 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-11-16 23:57:24,261 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-11-16 23:57:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-16 23:57:24,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-16 23:57:24,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 23:57:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 23:57:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 23:57:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 23:57:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 23:57:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 23:57:24,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 23:57:24,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 23:57:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 23:57:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 23:57:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-16 23:57:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 23:57:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 23:57:24,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-16 23:57:24,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 23:57:24,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 23:57:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 23:57:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:57:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 23:57:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 23:57:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 23:57:24,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 23:57:24,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 23:57:24,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 23:57:24,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:57:24,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:57:24,530 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:57:24,532 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:57:32,448 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-16 23:57:32,536 INFO L? ?]: Removed 136 outVars from TransFormulas that were not future-live. [2024-11-16 23:57:32,536 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:57:32,559 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:57:32,561 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:57:32,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:32 BoogieIcfgContainer [2024-11-16 23:57:32,562 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:57:32,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:57:32,564 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:57:32,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:57:32,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:22" (1/3) ... [2024-11-16 23:57:32,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f23627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:32, skipping insertion in model container [2024-11-16 23:57:32,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:23" (2/3) ... [2024-11-16 23:57:32,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12f23627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:32, skipping insertion in model container [2024-11-16 23:57:32,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:32" (3/3) ... [2024-11-16 23:57:32,582 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test3-1.i [2024-11-16 23:57:32,601 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:57:32,601 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 23:57:32,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:57:32,659 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;@6ff6e6e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:57:32,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 23:57:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 219 states, 203 states have (on average 1.645320197044335) internal successors, (334), 212 states have internal predecessors, (334), 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-11-16 23:57:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 23:57:32,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:32,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:32,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:32,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:32,682 INFO L85 PathProgramCache]: Analyzing trace with hash 149634381, now seen corresponding path program 1 times [2024-11-16 23:57:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014763113] [2024-11-16 23:57:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:32,695 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-11-16 23:57:32,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:32,698 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-11-16 23:57:32,700 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-11-16 23:57:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:32,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 23:57:32,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:32,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:32,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014763113] [2024-11-16 23:57:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014763113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:32,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:57:32,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171930907] [2024-11-16 23:57:32,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:32,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:57:32,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:32,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:57:32,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:57:32,948 INFO L87 Difference]: Start difference. First operand has 219 states, 203 states have (on average 1.645320197044335) internal successors, (334), 212 states have internal predecessors, (334), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:57:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:32,978 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2024-11-16 23:57:32,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:57:32,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-16 23:57:32,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:32,988 INFO L225 Difference]: With dead ends: 217 [2024-11-16 23:57:32,988 INFO L226 Difference]: Without dead ends: 214 [2024-11-16 23:57:32,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 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-11-16 23:57:32,993 INFO L432 NwaCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:32,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:57:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-16 23:57:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-11-16 23:57:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 200 states have (on average 1.305) internal successors, (261), 207 states have internal predecessors, (261), 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-11-16 23:57:33,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 279 transitions. [2024-11-16 23:57:33,045 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 279 transitions. Word has length 11 [2024-11-16 23:57:33,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:33,045 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 279 transitions. [2024-11-16 23:57:33,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:57:33,045 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 279 transitions. [2024-11-16 23:57:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 23:57:33,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:33,046 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:33,051 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-11-16 23:57:33,247 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-11-16 23:57:33,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:33,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1113122900, now seen corresponding path program 1 times [2024-11-16 23:57:33,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:33,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714203897] [2024-11-16 23:57:33,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:33,249 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-11-16 23:57:33,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:33,251 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-11-16 23:57:33,252 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-11-16 23:57:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:33,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:57:33,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:33,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:57:33,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:57:33,517 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:57:33,533 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-11-16 23:57:33,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:57:33,635 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-11-16 23:57:33,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:33,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:33,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:33,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714203897] [2024-11-16 23:57:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1714203897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:33,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8975455] [2024-11-16 23:57:33,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:33,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:33,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:33,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:33,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:33,669 INFO L87 Difference]: Start difference. First operand 214 states and 279 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-16 23:57:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:34,466 INFO L93 Difference]: Finished difference Result 410 states and 541 transitions. [2024-11-16 23:57:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:57:34,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-16 23:57:34,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:34,471 INFO L225 Difference]: With dead ends: 410 [2024-11-16 23:57:34,471 INFO L226 Difference]: Without dead ends: 410 [2024-11-16 23:57:34,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-11-16 23:57:34,477 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 242 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:34,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 827 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 23:57:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-11-16 23:57:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 216. [2024-11-16 23:57:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 202 states have (on average 1.301980198019802) internal successors, (263), 209 states have internal predecessors, (263), 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-11-16 23:57:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 281 transitions. [2024-11-16 23:57:34,510 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 281 transitions. Word has length 13 [2024-11-16 23:57:34,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:34,510 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 281 transitions. [2024-11-16 23:57:34,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-16 23:57:34,511 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 281 transitions. [2024-11-16 23:57:34,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 23:57:34,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:34,513 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:34,521 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-11-16 23:57:34,717 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-11-16 23:57:34,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:34,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:34,719 INFO L85 PathProgramCache]: Analyzing trace with hash -619358187, now seen corresponding path program 1 times [2024-11-16 23:57:34,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448737964] [2024-11-16 23:57:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:34,720 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-11-16 23:57:34,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:34,723 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-11-16 23:57:34,726 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-11-16 23:57:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:35,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:35,155 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:35,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:35,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:35,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:35,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448737964] [2024-11-16 23:57:35,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448737964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:35,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:35,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:35,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661865873] [2024-11-16 23:57:35,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:35,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:35,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:35,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:35,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:35,200 INFO L87 Difference]: Start difference. First operand 216 states and 281 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-11-16 23:57:35,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:35,358 INFO L93 Difference]: Finished difference Result 219 states and 276 transitions. [2024-11-16 23:57:35,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:57:35,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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 70 [2024-11-16 23:57:35,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:35,360 INFO L225 Difference]: With dead ends: 219 [2024-11-16 23:57:35,360 INFO L226 Difference]: Without dead ends: 219 [2024-11-16 23:57:35,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-11-16 23:57:35,362 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 30 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:35,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 727 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:57:35,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-16 23:57:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-16 23:57:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 205 states have (on average 1.2585365853658537) internal successors, (258), 212 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-11-16 23:57:35,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 276 transitions. [2024-11-16 23:57:35,380 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 276 transitions. Word has length 70 [2024-11-16 23:57:35,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:35,380 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 276 transitions. [2024-11-16 23:57:35,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-11-16 23:57:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 276 transitions. [2024-11-16 23:57:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-16 23:57:35,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:35,383 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:35,395 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 (4)] Forceful destruction successful, exit code 0 [2024-11-16 23:57:35,583 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-11-16 23:57:35,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1749030479, now seen corresponding path program 1 times [2024-11-16 23:57:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:35,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869457644] [2024-11-16 23:57:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:35,586 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-11-16 23:57:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:35,589 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-11-16 23:57:35,592 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-11-16 23:57:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:35,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:35,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:36,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:36,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869457644] [2024-11-16 23:57:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869457644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:57:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776585648] [2024-11-16 23:57:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:36,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:57:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:36,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:57:36,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:57:36,294 INFO L87 Difference]: Start difference. First operand 219 states and 276 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-16 23:57:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:37,078 INFO L93 Difference]: Finished difference Result 332 states and 415 transitions. [2024-11-16 23:57:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:57:37,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2024-11-16 23:57:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:37,081 INFO L225 Difference]: With dead ends: 332 [2024-11-16 23:57:37,081 INFO L226 Difference]: Without dead ends: 332 [2024-11-16 23:57:37,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11-16 23:57:37,082 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 91 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:37,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 555 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 23:57:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-16 23:57:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2024-11-16 23:57:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 315 states have (on average 1.2507936507936508) internal successors, (394), 322 states have internal predecessors, (394), 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-11-16 23:57:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 412 transitions. [2024-11-16 23:57:37,098 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 412 transitions. Word has length 70 [2024-11-16 23:57:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:37,098 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 412 transitions. [2024-11-16 23:57:37,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-11-16 23:57:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 412 transitions. [2024-11-16 23:57:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-16 23:57:37,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:37,103 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, 1, 1] [2024-11-16 23:57:37,116 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-11-16 23:57:37,304 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-11-16 23:57:37,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:37,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:37,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1509627115, now seen corresponding path program 1 times [2024-11-16 23:57:37,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:37,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314611273] [2024-11-16 23:57:37,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:37,306 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-11-16 23:57:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:37,310 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-11-16 23:57:37,311 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-11-16 23:57:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:37,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:37,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:37,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:37,828 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:37,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:37,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314611273] [2024-11-16 23:57:37,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314611273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:37,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:37,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:37,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706511417] [2024-11-16 23:57:37,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:37,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:37,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:37,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:37,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:37,830 INFO L87 Difference]: Start difference. First operand 329 states and 412 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (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-11-16 23:57:37,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:37,880 INFO L93 Difference]: Finished difference Result 332 states and 416 transitions. [2024-11-16 23:57:37,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:57:37,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (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 85 [2024-11-16 23:57:37,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:37,883 INFO L225 Difference]: With dead ends: 332 [2024-11-16 23:57:37,883 INFO L226 Difference]: Without dead ends: 332 [2024-11-16 23:57:37,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 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-11-16 23:57:37,885 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:37,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 791 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:57:37,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-16 23:57:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-11-16 23:57:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 317 states have (on average 1.252365930599369) internal successors, (397), 325 states have internal predecessors, (397), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 416 transitions. [2024-11-16 23:57:37,896 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 416 transitions. Word has length 85 [2024-11-16 23:57:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:37,897 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 416 transitions. [2024-11-16 23:57:37,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (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-11-16 23:57:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 416 transitions. [2024-11-16 23:57:37,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-16 23:57:37,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:37,899 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:37,912 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-11-16 23:57:38,099 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-11-16 23:57:38,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:38,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:38,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1521928399, now seen corresponding path program 1 times [2024-11-16 23:57:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:38,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205961271] [2024-11-16 23:57:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:38,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 23:57:38,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:38,102 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-11-16 23:57:38,103 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-11-16 23:57:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:38,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:57:38,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 23:57:38,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:57:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:57:38,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:38,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205961271] [2024-11-16 23:57:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205961271] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:57:38,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:57:38,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 23:57:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297919839] [2024-11-16 23:57:38,682 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:57:38,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:57:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:38,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:57:38,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:57:38,684 INFO L87 Difference]: Start difference. First operand 332 states and 416 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-11-16 23:57:38,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:38,853 INFO L93 Difference]: Finished difference Result 343 states and 432 transitions. [2024-11-16 23:57:38,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:57:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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 87 [2024-11-16 23:57:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:38,856 INFO L225 Difference]: With dead ends: 343 [2024-11-16 23:57:38,856 INFO L226 Difference]: Without dead ends: 343 [2024-11-16 23:57:38,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 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-11-16 23:57:38,857 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 4 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:38,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1834 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:57:38,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-16 23:57:38,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2024-11-16 23:57:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 325 states have (on average 1.2646153846153847) internal successors, (411), 333 states have internal predecessors, (411), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 430 transitions. [2024-11-16 23:57:38,868 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 430 transitions. Word has length 87 [2024-11-16 23:57:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 430 transitions. [2024-11-16 23:57:38,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 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-11-16 23:57:38,869 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 430 transitions. [2024-11-16 23:57:38,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 23:57:38,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:38,875 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:38,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-16 23:57:39,075 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-11-16 23:57:39,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:39,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:39,076 INFO L85 PathProgramCache]: Analyzing trace with hash -12481781, now seen corresponding path program 2 times [2024-11-16 23:57:39,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:39,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771581011] [2024-11-16 23:57:39,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:57:39,077 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-11-16 23:57:39,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:39,080 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-11-16 23:57:39,081 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-11-16 23:57:39,430 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:57:39,430 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:57:39,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 23:57:39,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:39,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:57:39,462 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:57:39,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 23:57:39,465 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-11-16 23:57:39,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 23:57:39,534 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-11-16 23:57:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-16 23:57:39,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:39,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771581011] [2024-11-16 23:57:39,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771581011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:39,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:39,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:39,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110758195] [2024-11-16 23:57:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:39,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:39,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:39,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:39,553 INFO L87 Difference]: Start difference. First operand 341 states and 430 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-11-16 23:57:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:39,921 INFO L93 Difference]: Finished difference Result 504 states and 644 transitions. [2024-11-16 23:57:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:57:39,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 91 [2024-11-16 23:57:39,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:39,925 INFO L225 Difference]: With dead ends: 504 [2024-11-16 23:57:39,925 INFO L226 Difference]: Without dead ends: 504 [2024-11-16 23:57:39,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-11-16 23:57:39,926 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 211 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:39,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 795 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 23:57:39,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2024-11-16 23:57:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 343. [2024-11-16 23:57:39,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 327 states have (on average 1.2629969418960245) internal successors, (413), 335 states have internal predecessors, (413), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 432 transitions. [2024-11-16 23:57:39,937 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 432 transitions. Word has length 91 [2024-11-16 23:57:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:39,938 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 432 transitions. [2024-11-16 23:57:39,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-11-16 23:57:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 432 transitions. [2024-11-16 23:57:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 23:57:39,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:39,939 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:57:39,947 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-11-16 23:57:40,140 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-11-16 23:57:40,140 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:40,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1196792518, now seen corresponding path program 1 times [2024-11-16 23:57:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413437691] [2024-11-16 23:57:40,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:40,142 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-11-16 23:57:40,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:40,143 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-11-16 23:57:40,144 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-11-16 23:57:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:40,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 615 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 23:57:40,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 23:57:40,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:57:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:57:41,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:41,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413437691] [2024-11-16 23:57:41,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413437691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:57:41,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:57:41,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 23:57:41,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863554101] [2024-11-16 23:57:41,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:57:41,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 23:57:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:41,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 23:57:41,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-16 23:57:41,036 INFO L87 Difference]: Start difference. First operand 343 states and 432 transitions. Second operand has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 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-11-16 23:57:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:41,517 INFO L93 Difference]: Finished difference Result 358 states and 454 transitions. [2024-11-16 23:57:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 23:57:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 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 127 [2024-11-16 23:57:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:41,521 INFO L225 Difference]: With dead ends: 358 [2024-11-16 23:57:41,521 INFO L226 Difference]: Without dead ends: 354 [2024-11-16 23:57:41,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 240 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-11-16 23:57:41,522 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 7 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:41,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1583 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 23:57:41,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-16 23:57:41,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-11-16 23:57:41,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 336 states have (on average 1.2648809523809523) internal successors, (425), 344 states have internal predecessors, (425), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:41,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 444 transitions. [2024-11-16 23:57:41,531 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 444 transitions. Word has length 127 [2024-11-16 23:57:41,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:41,531 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 444 transitions. [2024-11-16 23:57:41,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.428571428571429) internal successors, (132), 14 states have internal predecessors, (132), 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-11-16 23:57:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 444 transitions. [2024-11-16 23:57:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 23:57:41,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:41,533 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:57:41,549 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-11-16 23:57:41,734 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-11-16 23:57:41,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:41,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash -57059495, now seen corresponding path program 2 times [2024-11-16 23:57:41,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:41,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716763214] [2024-11-16 23:57:41,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:57:41,736 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-11-16 23:57:41,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:41,737 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-11-16 23:57:41,738 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-11-16 23:57:42,072 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:57:42,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:57:42,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:42,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-16 23:57:42,130 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:42,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716763214] [2024-11-16 23:57:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716763214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126793877] [2024-11-16 23:57:42,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:42,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:42,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:42,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:42,133 INFO L87 Difference]: Start difference. First operand 352 states and 444 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-11-16 23:57:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:42,282 INFO L93 Difference]: Finished difference Result 358 states and 434 transitions. [2024-11-16 23:57:42,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:57:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 136 [2024-11-16 23:57:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:42,285 INFO L225 Difference]: With dead ends: 358 [2024-11-16 23:57:42,285 INFO L226 Difference]: Without dead ends: 358 [2024-11-16 23:57:42,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 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-11-16 23:57:42,286 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 30 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:42,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 694 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:57:42,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-16 23:57:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2024-11-16 23:57:42,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 342 states have (on average 1.213450292397661) internal successors, (415), 350 states have internal predecessors, (415), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 434 transitions. [2024-11-16 23:57:42,296 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 434 transitions. Word has length 136 [2024-11-16 23:57:42,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:42,296 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 434 transitions. [2024-11-16 23:57:42,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-11-16 23:57:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 434 transitions. [2024-11-16 23:57:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 23:57:42,298 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:42,298 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:57:42,304 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-11-16 23:57:42,502 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-11-16 23:57:42,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:42,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:42,503 INFO L85 PathProgramCache]: Analyzing trace with hash 598201747, now seen corresponding path program 1 times [2024-11-16 23:57:42,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:42,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313672341] [2024-11-16 23:57:42,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:42,504 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-11-16 23:57:42,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:42,505 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-11-16 23:57:42,506 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-11-16 23:57:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:43,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 23:57:43,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 23:57:43,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:57:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-16 23:57:43,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:43,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313672341] [2024-11-16 23:57:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313672341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:57:43,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:57:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-16 23:57:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742828947] [2024-11-16 23:57:43,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:57:43,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 23:57:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 23:57:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-16 23:57:43,850 INFO L87 Difference]: Start difference. First operand 358 states and 434 transitions. Second operand has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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-11-16 23:57:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:45,830 INFO L93 Difference]: Finished difference Result 382 states and 474 transitions. [2024-11-16 23:57:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-16 23:57:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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 136 [2024-11-16 23:57:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:45,837 INFO L225 Difference]: With dead ends: 382 [2024-11-16 23:57:45,838 INFO L226 Difference]: Without dead ends: 378 [2024-11-16 23:57:45,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-16 23:57:45,839 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 13 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4274 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:45,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4274 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 23:57:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-16 23:57:45,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2024-11-16 23:57:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 360 states have (on average 1.2194444444444446) internal successors, (439), 368 states have internal predecessors, (439), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 458 transitions. [2024-11-16 23:57:45,849 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 458 transitions. Word has length 136 [2024-11-16 23:57:45,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:45,850 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 458 transitions. [2024-11-16 23:57:45,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.538461538461538) internal successors, (144), 26 states have internal predecessors, (144), 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-11-16 23:57:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 458 transitions. [2024-11-16 23:57:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-16 23:57:45,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:45,853 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:57:45,871 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-11-16 23:57:46,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 23:57:46,054 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:46,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:46,055 INFO L85 PathProgramCache]: Analyzing trace with hash -47136973, now seen corresponding path program 2 times [2024-11-16 23:57:46,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:46,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650599866] [2024-11-16 23:57:46,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:57:46,056 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-11-16 23:57:46,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:46,057 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-11-16 23:57:46,058 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-11-16 23:57:46,800 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:57:46,800 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:57:46,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 23:57:46,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:47,420 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-16 23:57:47,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:57:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-16 23:57:49,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:49,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650599866] [2024-11-16 23:57:49,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650599866] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:57:49,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:57:49,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-16 23:57:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696511185] [2024-11-16 23:57:49,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:57:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-16 23:57:49,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:49,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-16 23:57:49,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-16 23:57:49,165 INFO L87 Difference]: Start difference. First operand 376 states and 458 transitions. Second operand has 50 states, 50 states have (on average 3.36) internal successors, (168), 50 states have internal predecessors, (168), 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-11-16 23:57:55,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:55,461 INFO L93 Difference]: Finished difference Result 416 states and 530 transitions. [2024-11-16 23:57:55,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-16 23:57:55,462 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.36) internal successors, (168), 50 states have internal predecessors, (168), 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 154 [2024-11-16 23:57:55,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:55,464 INFO L225 Difference]: With dead ends: 416 [2024-11-16 23:57:55,464 INFO L226 Difference]: Without dead ends: 412 [2024-11-16 23:57:55,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-16 23:57:55,469 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 25 mSDsluCounter, 6546 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6800 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:55,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6800 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 23:57:55,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-16 23:57:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-11-16 23:57:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 394 states have (on average 1.2309644670050761) internal successors, (485), 402 states have internal predecessors, (485), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:57:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 504 transitions. [2024-11-16 23:57:55,481 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 504 transitions. Word has length 154 [2024-11-16 23:57:55,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:55,482 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 504 transitions. [2024-11-16 23:57:55,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.36) internal successors, (168), 50 states have internal predecessors, (168), 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-11-16 23:57:55,482 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 504 transitions. [2024-11-16 23:57:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 23:57:55,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:55,484 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:57:55,506 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-11-16 23:57:55,684 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-11-16 23:57:55,685 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:55,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:55,685 INFO L85 PathProgramCache]: Analyzing trace with hash 567459923, now seen corresponding path program 3 times [2024-11-16 23:57:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957966792] [2024-11-16 23:57:55,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 23:57:55,686 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-11-16 23:57:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:55,688 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-11-16 23:57:55,688 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-11-16 23:57:56,282 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 23:57:56,282 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:57:56,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:56,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-16 23:57:56,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:56,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:56,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957966792] [2024-11-16 23:57:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957966792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:56,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:56,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448448459] [2024-11-16 23:57:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:56,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:56,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:56,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:56,583 INFO L87 Difference]: Start difference. First operand 410 states and 504 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-11-16 23:58:00,915 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-11-16 23:58:04,921 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-11-16 23:58:07,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-16 23:58:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:07,722 INFO L93 Difference]: Finished difference Result 515 states and 638 transitions. [2024-11-16 23:58:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:58:07,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 188 [2024-11-16 23:58:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:07,727 INFO L225 Difference]: With dead ends: 515 [2024-11-16 23:58:07,727 INFO L226 Difference]: Without dead ends: 515 [2024-11-16 23:58:07,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 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-11-16 23:58:07,728 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 416 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:07,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 520 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-11-16 23:58:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-16 23:58:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 501. [2024-11-16 23:58:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 485 states have (on average 1.2268041237113403) internal successors, (595), 493 states have internal predecessors, (595), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:58:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 614 transitions. [2024-11-16 23:58:07,741 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 614 transitions. Word has length 188 [2024-11-16 23:58:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:07,742 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 614 transitions. [2024-11-16 23:58:07,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-11-16 23:58:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 614 transitions. [2024-11-16 23:58:07,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-16 23:58:07,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:07,744 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:58:07,759 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-11-16 23:58:07,944 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-11-16 23:58:07,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:07,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1004464207, now seen corresponding path program 1 times [2024-11-16 23:58:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43210194] [2024-11-16 23:58:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:07,946 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-11-16 23:58:07,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:07,950 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-11-16 23:58:07,951 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-11-16 23:58:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:09,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 23:58:09,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-16 23:58:09,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:11,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-16 23:58:11,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:11,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43210194] [2024-11-16 23:58:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43210194] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:11,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-16 23:58:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211746825] [2024-11-16 23:58:11,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:11,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-16 23:58:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:11,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-16 23:58:11,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 23:58:11,326 INFO L87 Difference]: Start difference. First operand 501 states and 614 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 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-11-16 23:58:18,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:18,004 INFO L93 Difference]: Finished difference Result 530 states and 668 transitions. [2024-11-16 23:58:18,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-16 23:58:18,005 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 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 197 [2024-11-16 23:58:18,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:18,007 INFO L225 Difference]: With dead ends: 530 [2024-11-16 23:58:18,007 INFO L226 Difference]: Without dead ends: 530 [2024-11-16 23:58:18,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-16 23:58:18,010 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 26 mSDsluCounter, 6527 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 6780 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:18,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 6780 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 23:58:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-16 23:58:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 526. [2024-11-16 23:58:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 510 states have (on average 1.2647058823529411) internal successors, (645), 518 states have internal predecessors, (645), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-16 23:58:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 664 transitions. [2024-11-16 23:58:18,020 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 664 transitions. Word has length 197 [2024-11-16 23:58:18,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:18,020 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 664 transitions. [2024-11-16 23:58:18,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 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-11-16 23:58:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 664 transitions. [2024-11-16 23:58:18,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-16 23:58:18,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:18,023 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-16 23:58:18,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-16 23:58:18,223 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-11-16 23:58:18,224 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:18,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash -102485628, now seen corresponding path program 2 times [2024-11-16 23:58:18,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824207541] [2024-11-16 23:58:18,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:18,225 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-11-16 23:58:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:18,227 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-11-16 23:58:18,229 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-11-16 23:58:20,154 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:58:20,154 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:20,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 1566 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 23:58:20,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-16 23:58:21,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-16 23:58:28,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:28,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824207541] [2024-11-16 23:58:28,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824207541] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:28,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:28,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-16 23:58:28,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020133504] [2024-11-16 23:58:28,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:28,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-16 23:58:28,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-16 23:58:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-16 23:58:28,023 INFO L87 Difference]: Start difference. First operand 526 states and 664 transitions. Second operand has 102 states, 102 states have (on average 2.2058823529411766) internal successors, (225), 102 states have internal predecessors, (225), 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)