./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test8_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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_test8_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 428ed4ebbacd235ea719e6f888a7e28edd9cc4f57416ea2a11ce399dc2c47283 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:19:23,187 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:19:23,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:19:23,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:19:23,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:19:23,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:19:23,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:19:23,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:19:23,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:19:23,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:19:23,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:19:23,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:19:23,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:19:23,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:19:23,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:19:23,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:19:23,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:19:23,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:19:23,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:19:23,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:19:23,307 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:19:23,308 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:19:23,308 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:19:23,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:19:23,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:19:23,309 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:19:23,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:19:23,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:19:23,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:19:23,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:19:23,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:19:23,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:19:23,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:19:23,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:19:23,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:19:23,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:19:23,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:19:23,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:19:23,312 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:19:23,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:19:23,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:19:23,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:19:23,314 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 -> 428ed4ebbacd235ea719e6f888a7e28edd9cc4f57416ea2a11ce399dc2c47283 [2024-11-10 15:19:23,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:19:23,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:19:23,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:19:23,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:19:23,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:19:23,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test8_2.i [2024-11-10 15:19:25,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:19:25,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:19:25,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test8_2.i [2024-11-10 15:19:25,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01a87785/99a1f1c63e584d3cb483bebfb73159a3/FLAG55222dda2 [2024-11-10 15:19:25,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b01a87785/99a1f1c63e584d3cb483bebfb73159a3 [2024-11-10 15:19:25,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:19:25,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:19:25,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:19:25,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:19:25,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:19:25,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:19:25" (1/1) ... [2024-11-10 15:19:25,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68aa2ff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:25, skipping insertion in model container [2024-11-10 15:19:25,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:19:25" (1/1) ... [2024-11-10 15:19:25,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:19:25,903 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:19:25,972 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:19:25,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:19:25,996 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-10 15:19:25,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@194d16dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:25, skipping insertion in model container [2024-11-10 15:19:25,997 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:19:25,997 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 15:19:25,999 INFO L158 Benchmark]: Toolchain (without parser) took 530.32ms. Allocated memory is still 199.2MB. Free memory was 142.6MB in the beginning and 126.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 15:19:26,000 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 199.2MB. Free memory was 174.6MB in the beginning and 174.4MB in the end (delta: 160.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:19:26,001 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.60ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 126.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 15:19:26,003 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 199.2MB. Free memory was 174.6MB in the beginning and 174.4MB in the end (delta: 160.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 527.60ms. Allocated memory is still 199.2MB. Free memory was 142.3MB in the beginning and 126.4MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. 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_test8_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 428ed4ebbacd235ea719e6f888a7e28edd9cc4f57416ea2a11ce399dc2c47283 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:19:28,069 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:19:28,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 15:19:28,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:19:28,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:19:28,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:19:28,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:19:28,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:19:28,198 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:19:28,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:19:28,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:19:28,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:19:28,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:19:28,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:19:28,204 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:19:28,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:19:28,205 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:19:28,205 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:19:28,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:19:28,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:19:28,206 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:19:28,207 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:19:28,207 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:19:28,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:19:28,208 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:19:28,208 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 15:19:28,208 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:19:28,208 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 15:19:28,208 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:19:28,209 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:19:28,209 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:19:28,209 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:19:28,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:19:28,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:19:28,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:19:28,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:19:28,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:19:28,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:19:28,213 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 15:19:28,213 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 15:19:28,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:19:28,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:19:28,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:19:28,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:19:28,214 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 -> 428ed4ebbacd235ea719e6f888a7e28edd9cc4f57416ea2a11ce399dc2c47283 [2024-11-10 15:19:28,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:19:28,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:19:28,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:19:28,583 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:19:28,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:19:28,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test8_2.i [2024-11-10 15:19:30,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:19:30,478 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:19:30,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test8_2.i [2024-11-10 15:19:30,498 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f925024b5/4ada2220139a44c68dcee4e1368d26b9/FLAG90aff8fff [2024-11-10 15:19:30,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f925024b5/4ada2220139a44c68dcee4e1368d26b9 [2024-11-10 15:19:30,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:19:30,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:19:30,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:19:30,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:19:30,793 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:19:30,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:19:30" (1/1) ... [2024-11-10 15:19:30,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76000cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:30, skipping insertion in model container [2024-11-10 15:19:30,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:19:30" (1/1) ... [2024-11-10 15:19:30,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:19:31,221 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:19:31,285 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:19:31,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:19:31,313 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 15:19:31,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:19:31,363 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:19:31,391 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 15:19:31,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:19:31,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:19:31,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:19:31,523 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:19:31,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31 WrapperNode [2024-11-10 15:19:31,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:19:31,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:19:31,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:19:31,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:19:31,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,586 INFO L138 Inliner]: procedures = 167, calls = 72, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 18 [2024-11-10 15:19:31,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:19:31,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:19:31,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:19:31,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:19:31,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,626 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-10 15:19:31,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:19:31,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:19:31,648 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:19:31,648 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:19:31,649 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (1/1) ... [2024-11-10 15:19:31,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:19:31,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:19:31,690 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-10 15:19:31,693 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-10 15:19:31,757 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-10 15:19:31,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-10 15:19:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:19:31,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 15:19:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure free_8 [2024-11-10 15:19:31,759 INFO L138 BoogieDeclarations]: Found implementation of procedure free_8 [2024-11-10 15:19:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:19:31,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-10 15:19:31,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-10 15:19:31,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:19:31,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:19:31,905 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:19:31,908 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:19:31,997 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-10 15:19:32,043 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2024-11-10 15:19:32,044 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:19:32,055 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:19:32,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:19:32,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:19:32 BoogieIcfgContainer [2024-11-10 15:19:32,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:19:32,058 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:19:32,058 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:19:32,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:19:32,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:19:30" (1/3) ... [2024-11-10 15:19:32,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba926a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:19:32, skipping insertion in model container [2024-11-10 15:19:32,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:19:31" (2/3) ... [2024-11-10 15:19:32,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba926a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:19:32, skipping insertion in model container [2024-11-10 15:19:32,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:19:32" (3/3) ... [2024-11-10 15:19:32,064 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test8_2.i [2024-11-10 15:19:32,081 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:19:32,081 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 15:19:32,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:19:32,133 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;@5266d2d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:19:32,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-10 15:19:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:19:32,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 15:19:32,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:19:32,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:19:32,147 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting free_8Err2ASSERT_VIOLATIONMEMORY_FREE === [free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:19:32,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:19:32,153 INFO L85 PathProgramCache]: Analyzing trace with hash 2031150412, now seen corresponding path program 1 times [2024-11-10 15:19:32,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:19:32,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493761017] [2024-11-10 15:19:32,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:19:32,167 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-10 15:19:32,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:19:32,171 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-10 15:19:32,172 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-10 15:19:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:19:32,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 15:19:32,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:19:32,363 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-10 15:19:32,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:19:32,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:19:32,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493761017] [2024-11-10 15:19:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493761017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:19:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:19:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:19:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775859287] [2024-11-10 15:19:32,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:19:32,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:19:32,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:19:32,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:19:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:19:32,403 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:19:32,506 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2024-11-10 15:19:32,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:19:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-10 15:19:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:19:32,514 INFO L225 Difference]: With dead ends: 28 [2024-11-10 15:19:32,514 INFO L226 Difference]: Without dead ends: 25 [2024-11-10 15:19:32,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:19:32,519 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 23 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:19:32,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 72 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:19:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-10 15:19:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-10 15:19:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:19:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-10 15:19:32,554 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2024-11-10 15:19:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:19:32,555 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-10 15:19:32,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-10 15:19:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:19:32,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:19:32,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:19:32,562 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-10 15:19:32,761 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-10 15:19:32,761 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting free_8Err1ASSERT_VIOLATIONMEMORY_FREE === [free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:19:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:19:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1458846695, now seen corresponding path program 1 times [2024-11-10 15:19:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:19:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035592617] [2024-11-10 15:19:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:19:32,763 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-10 15:19:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:19:32,766 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-10 15:19:32,767 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-10 15:19:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:19:32,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 15:19:32,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:19:32,973 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-10 15:19:32,973 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:19:32,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:19:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035592617] [2024-11-10 15:19:32,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035592617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:19:32,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:19:32,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:19:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919271548] [2024-11-10 15:19:32,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:19:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:19:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:19:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:19:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:19:32,980 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:19:33,119 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2024-11-10 15:19:33,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 15:19:33,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:19:33,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:19:33,121 INFO L225 Difference]: With dead ends: 40 [2024-11-10 15:19:33,121 INFO L226 Difference]: Without dead ends: 40 [2024-11-10 15:19:33,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:19:33,122 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:19:33,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 59 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:19:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-10 15:19:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-11-10 15:19:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 29 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:19:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-10 15:19:33,130 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 13 [2024-11-10 15:19:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:19:33,130 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-10 15:19:33,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2024-11-10 15:19:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 15:19:33,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:19:33,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:19:33,135 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-10 15:19:33,334 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-10 15:19:33,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting free_8Err1ASSERT_VIOLATIONMEMORY_FREE === [free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:19:33,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:19:33,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1028666138, now seen corresponding path program 1 times [2024-11-10 15:19:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:19:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170119833] [2024-11-10 15:19:33,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:19:33,337 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-10 15:19:33,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:19:33,340 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-10 15:19:33,341 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-10 15:19:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:19:33,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:19:33,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:19:33,485 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-10 15:19:33,485 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:19:33,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:19:33,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170119833] [2024-11-10 15:19:33,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170119833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:19:33,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:19:33,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:19:33,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454848008] [2024-11-10 15:19:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:19:33,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:19:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:19:33,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:19:33,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:19:33,487 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:33,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:19:33,554 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2024-11-10 15:19:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:19:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-10 15:19:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:19:33,555 INFO L225 Difference]: With dead ends: 34 [2024-11-10 15:19:33,555 INFO L226 Difference]: Without dead ends: 34 [2024-11-10 15:19:33,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:19:33,556 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:19:33,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 85 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:19:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-10 15:19:33,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-10 15:19:33,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:19:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-11-10 15:19:33,566 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 13 [2024-11-10 15:19:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:19:33,566 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-11-10 15:19:33,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-11-10 15:19:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 15:19:33,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:19:33,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:19:33,570 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-10 15:19:33,770 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-10 15:19:33,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting free_8Err0ASSERT_VIOLATIONMEMORY_FREE === [free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:19:33,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:19:33,771 INFO L85 PathProgramCache]: Analyzing trace with hash 2020392682, now seen corresponding path program 1 times [2024-11-10 15:19:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:19:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653508955] [2024-11-10 15:19:33,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:19:33,772 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-10 15:19:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:19:33,775 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-10 15:19:33,776 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-10 15:19:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:19:33,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 15:19:33,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:19:33,859 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-10 15:19:33,908 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-10 15:19:33,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:19:33,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:19:33,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653508955] [2024-11-10 15:19:33,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1653508955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:19:33,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:19:33,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:19:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726499173] [2024-11-10 15:19:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:19:33,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:19:33,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:19:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:19:33,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:19:33,911 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:33,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:19:33,962 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2024-11-10 15:19:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:19:33,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-10 15:19:33,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:19:33,964 INFO L225 Difference]: With dead ends: 38 [2024-11-10 15:19:33,964 INFO L226 Difference]: Without dead ends: 38 [2024-11-10 15:19:33,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:19:33,966 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:19:33,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:19:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-10 15:19:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2024-11-10 15:19:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 27 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-10 15:19:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2024-11-10 15:19:33,981 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 14 [2024-11-10 15:19:33,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:19:33,981 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2024-11-10 15:19:33,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 15:19:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2024-11-10 15:19:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 15:19:33,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:19:33,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:19:33,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 15:19:34,183 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-10 15:19:34,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:19:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:19:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1197030543, now seen corresponding path program 1 times [2024-11-10 15:19:34,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:19:34,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1853970595] [2024-11-10 15:19:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:19:34,185 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-10 15:19:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:19:34,186 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-10 15:19:34,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 15:19:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:19:34,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 15:19:34,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:19:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 15:19:34,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 15:19:34,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 15:19:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1853970595] [2024-11-10 15:19:34,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1853970595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:19:34,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:19:34,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:19:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935373087] [2024-11-10 15:19:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:19:34,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:19:34,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 15:19:34,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:19:34,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:19:34,274 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:19:34,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:19:34,313 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2024-11-10 15:19:34,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:19:34,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-11-10 15:19:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:19:34,315 INFO L225 Difference]: With dead ends: 41 [2024-11-10 15:19:34,316 INFO L226 Difference]: Without dead ends: 28 [2024-11-10 15:19:34,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-10 15:19:34,317 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:19:34,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 51 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:19:34,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-10 15:19:34,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-10 15:19:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 15:19:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-10 15:19:34,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 21 [2024-11-10 15:19:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:19:34,330 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-10 15:19:34,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 15:19:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-10 15:19:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 15:19:34,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:19:34,331 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:19:34,337 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-10 15:19:34,532 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-10 15:19:34,532 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting free_8Err0ASSERT_VIOLATIONMEMORY_FREE === [free_8Err0ASSERT_VIOLATIONMEMORY_FREE, free_8Err1ASSERT_VIOLATIONMEMORY_FREE, free_8Err2ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 15:19:34,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:19:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash 493279852, now seen corresponding path program 1 times [2024-11-10 15:19:34,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 15:19:34,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202784710] [2024-11-10 15:19:34,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:19:34,534 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-10 15:19:34,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 15:19:34,535 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-10 15:19:34,536 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-10 15:19:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:19:34,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 15:19:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 15:19:34,641 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 15:19:34,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 15:19:34,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location free_8Err0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2024-11-10 15:19:34,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location free_8Err1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2024-11-10 15:19:34,645 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location free_8Err2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2024-11-10 15:19:34,646 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2024-11-10 15:19:34,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 15:19:34,849 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-10 15:19:34,852 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 15:19:34,883 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 15:19:34,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:19:34 BoogieIcfgContainer [2024-11-10 15:19:34,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 15:19:34,892 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 15:19:34,892 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 15:19:34,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 15:19:34,893 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:19:32" (3/4) ... [2024-11-10 15:19:34,894 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 15:19:34,943 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 15:19:34,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 15:19:34,944 INFO L158 Benchmark]: Toolchain (without parser) took 4157.17ms. Allocated memory was 65.0MB in the beginning and 104.9MB in the end (delta: 39.8MB). Free memory was 40.5MB in the beginning and 68.1MB in the end (delta: -27.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,944 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 65.0MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 15:19:34,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 736.20ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 40.4MB in the beginning and 47.5MB in the end (delta: -7.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.85ms. Allocated memory is still 86.0MB. Free memory was 47.5MB in the beginning and 45.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,945 INFO L158 Benchmark]: Boogie Preprocessor took 57.39ms. Allocated memory is still 86.0MB. Free memory was 45.4MB in the beginning and 43.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,945 INFO L158 Benchmark]: IcfgBuilder took 411.54ms. Allocated memory is still 86.0MB. Free memory was 43.3MB in the beginning and 56.1MB in the end (delta: -12.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,946 INFO L158 Benchmark]: TraceAbstraction took 2833.39ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 70.3MB in the end (delta: -14.6MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,946 INFO L158 Benchmark]: Witness Printer took 51.38ms. Allocated memory is still 104.9MB. Free memory was 70.3MB in the beginning and 68.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 15:19:34,948 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.09ms. Allocated memory is still 65.0MB. Free memory is still 41.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 736.20ms. Allocated memory was 65.0MB in the beginning and 86.0MB in the end (delta: 21.0MB). Free memory was 40.4MB in the beginning and 47.5MB in the end (delta: -7.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.85ms. Allocated memory is still 86.0MB. Free memory was 47.5MB in the beginning and 45.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.39ms. Allocated memory is still 86.0MB. Free memory was 45.4MB in the beginning and 43.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 411.54ms. Allocated memory is still 86.0MB. Free memory was 43.3MB in the beginning and 56.1MB in the end (delta: -12.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2833.39ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 70.3MB in the end (delta: -14.6MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Witness Printer took 51.38ms. Allocated memory is still 104.9MB. Free memory was 70.3MB in the beginning and 68.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 762]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L757] int *a8; VAL [a8={0:0}, ldv_global_msg_list={1:0}] [L771] CALL entry_point() [L765] CALL alloc_8() [L759] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a8={0:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L759] RET, EXPR ldv_malloc(sizeof(int)) VAL [a8={0:0}, ldv_global_msg_list={1:0}] [L759] a8 = (int *)ldv_malloc(sizeof(int)) [L765] RET alloc_8() [L766] CALL free_8() VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] COND TRUE \read(*a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] free(a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] free(a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] free(a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L766] RET free_8() VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L767] CALL free_8() VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] COND TRUE \read(*a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] free(a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] free(a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] [L762] free(a8) VAL [a8={2:0}, ldv_global_msg_list={1:0}] - UnprovableResult [Line: 762]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 762]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 770]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 29 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 125 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=2, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 1 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 3/3 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-10 15:19:34,979 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)