./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc 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/ldv-memsafety/memleaks_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b68a60a1004db041631656acc5775ad13321e46c020cb1a181ddf112036ec7ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:50:17,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:50:17,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:50:17,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:50:17,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:50:17,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:50:17,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:50:17,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:50:17,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:50:17,160 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:50:17,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:50:17,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:50:17,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:50:17,165 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:50:17,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:50:17,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:50:17,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:50:17,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:50:17,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:50:17,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:50:17,167 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:50:17,168 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:50:17,168 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:50:17,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:50:17,168 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:50:17,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:50:17,169 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:50:17,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:50:17,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:50:17,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:50:17,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:50:17,170 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:50:17,170 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:50:17,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:17,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:50:17,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:50:17,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:50:17,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:50:17,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:50:17,172 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:50:17,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:50:17,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:50:17,175 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b68a60a1004db041631656acc5775ad13321e46c020cb1a181ddf112036ec7ab [2024-11-19 06:50:17,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:50:17,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:50:17,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:50:17,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:50:17,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:50:17,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test3-2.i [2024-11-19 06:50:18,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:50:19,224 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:50:19,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test3-2.i [2024-11-19 06:50:19,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6347e444/361fbab3c5a04ba2936d057ed560011e/FLAG36d0213ec [2024-11-19 06:50:19,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6347e444/361fbab3c5a04ba2936d057ed560011e [2024-11-19 06:50:19,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:50:19,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:50:19,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:19,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:50:19,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:50:19,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:19" (1/1) ... [2024-11-19 06:50:19,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e8c14fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:19, skipping insertion in model container [2024-11-19 06:50:19,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:19" (1/1) ... [2024-11-19 06:50:19,602 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:20,077 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:20,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:20,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:20,163 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-19 06:50:20,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@754cfb9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:20, skipping insertion in model container [2024-11-19 06:50:20,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:20,164 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:50:20,166 INFO L158 Benchmark]: Toolchain (without parser) took 625.49ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 126.8MB in the end (delta: -30.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 06:50:20,167 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory was 136.0MB in the beginning and 136.0MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:50:20,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.70ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 126.8MB in the end (delta: -30.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 06:50:20,170 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.23ms. Allocated memory is still 167.8MB. Free memory was 136.0MB in the beginning and 136.0MB in the end (delta: 16.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.70ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 126.8MB in the end (delta: -30.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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/ldv-memsafety/memleaks_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b68a60a1004db041631656acc5775ad13321e46c020cb1a181ddf112036ec7ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:50:22,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:50:22,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:50:22,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:50:22,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:50:22,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:50:22,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:50:22,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:50:22,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:50:22,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:50:22,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:50:22,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:50:22,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:50:22,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:50:22,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:50:22,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:50:22,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:50:22,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:50:22,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:50:22,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:50:22,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:50:22,531 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:50:22,531 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:50:22,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:50:22,532 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:50:22,532 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:50:22,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:50:22,534 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:50:22,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:50:22,536 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:50:22,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:50:22,537 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:50:22,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:50:22,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:50:22,538 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:50:22,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:22,538 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:50:22,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:50:22,539 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:50:22,539 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:50:22,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:50:22,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:50:22,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:50:22,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:50:22,542 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> b68a60a1004db041631656acc5775ad13321e46c020cb1a181ddf112036ec7ab [2024-11-19 06:50:22,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:50:22,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:50:22,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:50:22,935 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:50:22,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:50:22,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test3-2.i [2024-11-19 06:50:24,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:50:24,823 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:50:24,824 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test3-2.i [2024-11-19 06:50:24,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563260fa7/a9b43c194ddf47368bb9b0a630564c52/FLAGc114d8997 [2024-11-19 06:50:25,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/563260fa7/a9b43c194ddf47368bb9b0a630564c52 [2024-11-19 06:50:25,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:50:25,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:50:25,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:25,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:50:25,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:50:25,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d709958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25, skipping insertion in model container [2024-11-19 06:50:25,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:25,513 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:25,573 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:25,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:25,596 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:50:25,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:25,633 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:25,672 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:25,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:25,685 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:50:25,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:25,825 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:50:25,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25 WrapperNode [2024-11-19 06:50:25,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:25,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:50:25,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:50:25,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:50:25,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,894 INFO L138 Inliner]: procedures = 166, calls = 70, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 23 [2024-11-19 06:50:25,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:50:25,895 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:50:25,896 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:50:25,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:50:25,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,925 INFO L175 MemorySlicer]: Split 2 memory accesses to 2 slices as follows [2, 0]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 0 writes are split as follows [0, 0]. [2024-11-19 06:50:25,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:50:25,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:50:25,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:50:25,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:50:25,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (1/1) ... [2024-11-19 06:50:25,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:50:25,982 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-19 06:50:25,986 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-19 06:50:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:50:26,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:50:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:50:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:50:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:50:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:50:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:50:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:50:26,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:50:26,162 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:50:26,164 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:50:26,302 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 06:50:26,318 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:50:26,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:50:26,330 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 06:50:26,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:26 BoogieIcfgContainer [2024-11-19 06:50:26,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:50:26,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:50:26,334 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:50:26,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:50:26,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:50:25" (1/3) ... [2024-11-19 06:50:26,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8bb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:26, skipping insertion in model container [2024-11-19 06:50:26,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:25" (2/3) ... [2024-11-19 06:50:26,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e8bb63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:26, skipping insertion in model container [2024-11-19 06:50:26,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:26" (3/3) ... [2024-11-19 06:50:26,340 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test3-2.i [2024-11-19 06:50:26,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:50:26,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-19 06:50:26,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:50:26,415 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;@79b6283c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:50:26,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-19 06:50:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:26,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:50:26,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:26,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:26,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:26,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 810737947, now seen corresponding path program 1 times [2024-11-19 06:50:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:26,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635690299] [2024-11-19 06:50:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:26,453 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-19 06:50:26,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:26,457 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-19 06:50:26,458 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-19 06:50:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:26,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:50:26,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:26,683 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-19 06:50:26,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:26,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:26,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635690299] [2024-11-19 06:50:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635690299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:26,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615753052] [2024-11-19 06:50:26,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:26,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:26,737 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:26,784 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-19 06:50:26,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:26,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-19 06:50:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:26,794 INFO L225 Difference]: With dead ends: 20 [2024-11-19 06:50:26,795 INFO L226 Difference]: Without dead ends: 18 [2024-11-19 06:50:26,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:26,802 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:26,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-19 06:50:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-19 06:50:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-11-19 06:50:26,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 11 [2024-11-19 06:50:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:26,837 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-11-19 06:50:26,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:26,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-11-19 06:50:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:26,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:26,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:26,844 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-19 06:50:27,039 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-19 06:50:27,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:27,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash -636919425, now seen corresponding path program 1 times [2024-11-19 06:50:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:27,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633698381] [2024-11-19 06:50:27,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:27,045 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-19 06:50:27,048 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-19 06:50:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:27,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:50:27,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:27,154 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-19 06:50:27,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:27,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:27,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633698381] [2024-11-19 06:50:27,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633698381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:27,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:27,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:27,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247667558] [2024-11-19 06:50:27,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:27,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:27,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:27,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:27,158 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:27,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:27,204 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-19 06:50:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:27,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:27,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:27,205 INFO L225 Difference]: With dead ends: 26 [2024-11-19 06:50:27,205 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 06:50:27,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:27,207 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:27,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:27,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 06:50:27,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-19 06:50:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:50:27,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-19 06:50:27,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 12 [2024-11-19 06:50:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:27,221 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-19 06:50:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-19 06:50:27,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:27,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:27,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:27,225 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-19 06:50:27,422 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-19 06:50:27,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:27,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:27,424 INFO L85 PathProgramCache]: Analyzing trace with hash -636927370, now seen corresponding path program 1 times [2024-11-19 06:50:27,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:27,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025086219] [2024-11-19 06:50:27,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:27,425 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-19 06:50:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:27,428 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-19 06:50:27,429 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-19 06:50:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:27,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:50:27,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:27,646 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-19 06:50:27,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:27,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:27,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025086219] [2024-11-19 06:50:27,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025086219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:27,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:27,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:27,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958288593] [2024-11-19 06:50:27,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:27,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:50:27,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:50:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:50:27,651 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:27,744 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2024-11-19 06:50:27,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 06:50:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:27,745 INFO L225 Difference]: With dead ends: 26 [2024-11-19 06:50:27,745 INFO L226 Difference]: Without dead ends: 26 [2024-11-19 06:50:27,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:50:27,747 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:27,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:50:27,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-19 06:50:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-19 06:50:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:50:27,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-19 06:50:27,751 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 12 [2024-11-19 06:50:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:27,752 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-19 06:50:27,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-19 06:50:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:27,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:27,753 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:27,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:50:27,953 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-19 06:50:27,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:27,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1105890910, now seen corresponding path program 1 times [2024-11-19 06:50:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879198697] [2024-11-19 06:50:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:27,955 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-19 06:50:27,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:27,959 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-19 06:50:27,960 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-19 06:50:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:28,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:28,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:28,044 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-19 06:50:28,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:28,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:28,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879198697] [2024-11-19 06:50:28,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879198697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:28,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:28,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:50:28,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200889335] [2024-11-19 06:50:28,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:28,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:28,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:28,047 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:28,080 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2024-11-19 06:50:28,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:28,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:28,081 INFO L225 Difference]: With dead ends: 29 [2024-11-19 06:50:28,081 INFO L226 Difference]: Without dead ends: 27 [2024-11-19 06:50:28,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-19 06:50:28,083 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:28,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-19 06:50:28,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2024-11-19 06:50:28,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:50:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2024-11-19 06:50:28,087 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 12 [2024-11-19 06:50:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:28,088 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2024-11-19 06:50:28,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,088 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2024-11-19 06:50:28,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:28,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:28,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:28,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:28,291 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-19 06:50:28,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:28,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:28,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1105882965, now seen corresponding path program 1 times [2024-11-19 06:50:28,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:28,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187169662] [2024-11-19 06:50:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:28,293 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-19 06:50:28,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:28,296 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-19 06:50:28,297 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-19 06:50:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:28,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 06:50:28,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:28,436 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-19 06:50:28,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:28,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187169662] [2024-11-19 06:50:28,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187169662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:28,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:28,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:28,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054686143] [2024-11-19 06:50:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:28,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:28,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:28,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:28,445 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:28,509 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-11-19 06:50:28,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:28,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:28,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:28,510 INFO L225 Difference]: With dead ends: 22 [2024-11-19 06:50:28,510 INFO L226 Difference]: Without dead ends: 17 [2024-11-19 06:50:28,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:28,513 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:28,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:50:28,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-19 06:50:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-19 06:50:28,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-11-19 06:50:28,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 12 [2024-11-19 06:50:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:28,520 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-11-19 06:50:28,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,521 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-11-19 06:50:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:50:28,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:28,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:28,526 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 (6)] Ended with exit code 0 [2024-11-19 06:50:28,722 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-19 06:50:28,723 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:28,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:28,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1730088061, now seen corresponding path program 1 times [2024-11-19 06:50:28,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:28,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555012218] [2024-11-19 06:50:28,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:28,724 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-19 06:50:28,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:28,727 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-19 06:50:28,728 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-19 06:50:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:28,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:50:28,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:28,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2024-11-19 06:50:28,849 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-19 06:50:28,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:28,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:28,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555012218] [2024-11-19 06:50:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [555012218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:28,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:28,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:28,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309946381] [2024-11-19 06:50:28,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:28,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:28,853 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:28,891 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-11-19 06:50:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:28,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-19 06:50:28,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:28,893 INFO L225 Difference]: With dead ends: 16 [2024-11-19 06:50:28,893 INFO L226 Difference]: Without dead ends: 16 [2024-11-19 06:50:28,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:28,894 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:28,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-19 06:50:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-19 06:50:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-11-19 06:50:28,897 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 13 [2024-11-19 06:50:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:28,897 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-11-19 06:50:28,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-11-19 06:50:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 06:50:28,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:28,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:28,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:50:29,101 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-19 06:50:29,102 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2024-11-19 06:50:29,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash 462284832, now seen corresponding path program 1 times [2024-11-19 06:50:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025952754] [2024-11-19 06:50:29,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:29,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:29,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:29,104 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-19 06:50:29,105 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-19 06:50:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:29,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 06:50:29,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:29,318 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~p~0#1.base_11| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_11| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~p~0#1.base_11|)))) is different from true [2024-11-19 06:50:29,328 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-19 06:50:29,328 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:29,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:29,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025952754] [2024-11-19 06:50:29,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025952754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:29,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:29,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 06:50:29,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970801128] [2024-11-19 06:50:29,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:29,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 06:50:29,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:29,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 06:50:29,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=44, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:50:29,331 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:29,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:29,415 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2024-11-19 06:50:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 06:50:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-19 06:50:29,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:29,417 INFO L225 Difference]: With dead ends: 15 [2024-11-19 06:50:29,417 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 06:50:29,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=57, Unknown=1, NotChecked=14, Total=90 [2024-11-19 06:50:29,418 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:29,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 26 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2024-11-19 06:50:29,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 06:50:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 06:50:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-19 06:50:29,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 06:50:29,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-19 06:50:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:29,425 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 06:50:29,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 8 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 06:50:29,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 06:50:29,428 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2024-11-19 06:50:29,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2024-11-19 06:50:29,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2024-11-19 06:50:29,429 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-19 06:50:29,433 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-19 06:50:29,632 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-19 06:50:29,635 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:29,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 06:50:29,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:50:29 BoogieIcfgContainer [2024-11-19 06:50:29,641 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 06:50:29,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 06:50:29,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 06:50:29,642 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 06:50:29,642 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:26" (3/4) ... [2024-11-19 06:50:29,648 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 06:50:29,652 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-11-19 06:50:29,658 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-11-19 06:50:29,658 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 06:50:29,659 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-19 06:50:29,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 06:50:29,752 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 06:50:29,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 06:50:29,753 INFO L158 Benchmark]: Toolchain (without parser) took 4662.70ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 39.1MB in the beginning and 30.7MB in the end (delta: 8.4MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,753 INFO L158 Benchmark]: CDTParser took 1.26ms. Allocated memory is still 52.4MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:50:29,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 735.11ms. Allocated memory is still 62.9MB. Free memory was 39.0MB in the beginning and 37.3MB in the end (delta: 1.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.82ms. Allocated memory is still 62.9MB. Free memory was 37.3MB in the beginning and 34.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,754 INFO L158 Benchmark]: Boogie Preprocessor took 45.83ms. Allocated memory is still 62.9MB. Free memory was 34.9MB in the beginning and 33.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,754 INFO L158 Benchmark]: RCFGBuilder took 385.98ms. Allocated memory is still 62.9MB. Free memory was 32.8MB in the beginning and 38.0MB in the end (delta: -5.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,754 INFO L158 Benchmark]: TraceAbstraction took 3307.53ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 35.4MB in the end (delta: 2.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,754 INFO L158 Benchmark]: Witness Printer took 110.48ms. Allocated memory is still 75.5MB. Free memory was 34.9MB in the beginning and 30.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 06:50:29,756 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.26ms. Allocated memory is still 52.4MB. Free memory is still 28.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 735.11ms. Allocated memory is still 62.9MB. Free memory was 39.0MB in the beginning and 37.3MB in the end (delta: 1.7MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.82ms. Allocated memory is still 62.9MB. Free memory was 37.3MB in the beginning and 34.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.83ms. Allocated memory is still 62.9MB. Free memory was 34.9MB in the beginning and 33.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.98ms. Allocated memory is still 62.9MB. Free memory was 32.8MB in the beginning and 38.0MB in the end (delta: -5.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3307.53ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 35.4MB in the end (delta: 2.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 110.48ms. Allocated memory is still 75.5MB. Free memory was 34.9MB in the beginning and 30.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27 mSDsluCounter, 341 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 267 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 99 mSDtfsCounter, 267 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 80 ConstructedInterpolants, 2 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 269 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 06:50:29,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE