./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.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 f002fb5adc832f6023a0c06b1c5ecdb23a860b09113c230254f6be0919311eb2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:35:31,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:35:31,728 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:35:31,735 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:35:31,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:35:31,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:35:31,758 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:35:31,758 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:35:31,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:35:31,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:35:31,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:35:31,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:35:31,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:35:31,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:35:31,760 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:35:31,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:35:31,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:35:31,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:35:31,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:35:31,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:35:31,764 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:35:31,764 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:35:31,764 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:35:31,764 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:35:31,765 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:35:31,765 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:35:31,765 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:35:31,765 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:35:31,765 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:35:31,765 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:35:31,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:35:31,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:35:31,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:35:31,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:35:31,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:35:31,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:35:31,766 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:35:31,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:35:31,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:35:31,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:35:31,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:35:31,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:35:31,769 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 -> f002fb5adc832f6023a0c06b1c5ecdb23a860b09113c230254f6be0919311eb2 [2024-11-17 00:35:31,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:35:31,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:35:32,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:35:32,001 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:35:32,006 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:35:32,008 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2024-11-17 00:35:33,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:35:33,527 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:35:33,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2024-11-17 00:35:33,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab75372fa/54f2aa89b6334bcc92e55e2f1c859158/FLAG4a34c606a [2024-11-17 00:35:33,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab75372fa/54f2aa89b6334bcc92e55e2f1c859158 [2024-11-17 00:35:33,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:35:33,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:35:33,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:35:33,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:35:33,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:35:33,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:35:33" (1/1) ... [2024-11-17 00:35:33,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6704c14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:33, skipping insertion in model container [2024-11-17 00:35:33,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:35:33" (1/1) ... [2024-11-17 00:35:33,600 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:35:33,887 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-17 00:35:33,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:35:33,954 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-17 00:35:33,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4a97d01d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:33, skipping insertion in model container [2024-11-17 00:35:33,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:35:33,955 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:35:33,956 INFO L158 Benchmark]: Toolchain (without parser) took 397.44ms. Allocated memory is still 178.3MB. Free memory was 108.8MB in the beginning and 146.8MB in the end (delta: -38.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:35:33,957 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:35:33,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.71ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 146.8MB in the end (delta: -38.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-17 00:35:33,959 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.27ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.71ms. Allocated memory is still 178.3MB. Free memory was 108.6MB in the beginning and 146.8MB in the end (delta: -38.2MB). Peak memory consumption was 12.6MB. 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_test22_2-1.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 f002fb5adc832f6023a0c06b1c5ecdb23a860b09113c230254f6be0919311eb2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:35:35,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:35:35,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 00:35:35,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:35:36,000 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:35:36,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:35:36,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:35:36,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:35:36,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:35:36,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:35:36,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:35:36,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:35:36,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:35:36,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:35:36,031 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:35:36,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:35:36,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:35:36,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:35:36,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:35:36,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:35:36,035 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:35:36,035 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:35:36,036 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:35:36,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:35:36,036 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:35:36,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:35:36,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:35:36,039 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:35:36,040 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:35:36,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:35:36,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:35:36,040 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:35:36,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:35:36,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:35:36,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:35:36,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:35:36,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:35:36,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:35:36,042 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:35:36,042 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:35:36,042 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:35:36,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:35:36,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:35:36,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:35:36,044 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 -> f002fb5adc832f6023a0c06b1c5ecdb23a860b09113c230254f6be0919311eb2 [2024-11-17 00:35:36,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:35:36,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:35:36,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:35:36,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:35:36,332 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:35:36,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2024-11-17 00:35:37,756 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:35:37,991 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:35:37,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2024-11-17 00:35:38,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360f16cbd/fe819c8d6afb422f88e581d1851105e3/FLAG489533c31 [2024-11-17 00:35:38,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/360f16cbd/fe819c8d6afb422f88e581d1851105e3 [2024-11-17 00:35:38,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:35:38,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:35:38,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:35:38,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:35:38,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:35:38,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58be7a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38, skipping insertion in model container [2024-11-17 00:35:38,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:35:38,352 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-17 00:35:38,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:35:38,420 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:35:38,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:35:38,457 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-17 00:35:38,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:35:38,479 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:35:38,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:35:38,555 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:35:38,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38 WrapperNode [2024-11-17 00:35:38,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:35:38,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:35:38,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:35:38,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:35:38,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,599 INFO L138 Inliner]: procedures = 165, calls = 68, calls flagged for inlining = 22, calls inlined = 8, statements flattened = 45 [2024-11-17 00:35:38,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:35:38,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:35:38,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:35:38,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:35:38,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,630 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-17 00:35:38,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:35:38,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:35:38,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:35:38,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:35:38,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (1/1) ... [2024-11-17 00:35:38,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:35:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:35:38,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-17 00:35:38,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-17 00:35:38,729 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-17 00:35:38,729 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-17 00:35:38,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:35:38,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:35:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:35:38,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:35:38,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:35:38,843 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:35:38,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:35:38,872 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L527: havoc #t~malloc12.base, #t~malloc12.offset; [2024-11-17 00:35:39,022 INFO L? ?]: Removed 44 outVars from TransFormulas that were not future-live. [2024-11-17 00:35:39,022 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:35:39,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:35:39,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:35:39,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:35:39 BoogieIcfgContainer [2024-11-17 00:35:39,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:35:39,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:35:39,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:35:39,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:35:39,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:35:38" (1/3) ... [2024-11-17 00:35:39,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc5b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:35:39, skipping insertion in model container [2024-11-17 00:35:39,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:38" (2/3) ... [2024-11-17 00:35:39,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc5b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:35:39, skipping insertion in model container [2024-11-17 00:35:39,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:35:39" (3/3) ... [2024-11-17 00:35:39,049 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-1.i [2024-11-17 00:35:39,063 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:35:39,063 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-17 00:35:39,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:35:39,112 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;@2eb83a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:35:39,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-17 00:35:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:35:39,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:39,125 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:39,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:39,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:39,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1799544971, now seen corresponding path program 1 times [2024-11-17 00:35:39,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:39,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531379205] [2024-11-17 00:35:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:39,143 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-17 00:35:39,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:39,147 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-17 00:35:39,151 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-17 00:35:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:39,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:35:39,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:39,322 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-17 00:35:39,382 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-17 00:35:39,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:39,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531379205] [2024-11-17 00:35:39,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531379205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:39,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:39,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:35:39,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936933896] [2024-11-17 00:35:39,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:39,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:35:39,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:35:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:35:39,424 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:39,615 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-17 00:35:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:35:39,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-17 00:35:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:39,624 INFO L225 Difference]: With dead ends: 63 [2024-11-17 00:35:39,624 INFO L226 Difference]: Without dead ends: 60 [2024-11-17 00:35:39,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:35:39,629 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 27 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:39,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 117 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:35:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-17 00:35:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2024-11-17 00:35:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:35:39,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2024-11-17 00:35:39,658 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 10 [2024-11-17 00:35:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:39,658 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2024-11-17 00:35:39,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2024-11-17 00:35:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:35:39,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:39,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:39,662 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-17 00:35:39,860 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-17 00:35:39,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:39,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:39,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1770915820, now seen corresponding path program 1 times [2024-11-17 00:35:39,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:39,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545315388] [2024-11-17 00:35:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:39,861 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-17 00:35:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:39,864 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-17 00:35:39,865 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-17 00:35:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:39,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:35:39,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:40,020 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-17 00:35:40,023 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:40,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:40,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545315388] [2024-11-17 00:35:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545315388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:40,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:40,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:35:40,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538552256] [2024-11-17 00:35:40,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:40,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:35:40,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:40,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:35:40,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:35:40,026 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:40,061 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-17 00:35:40,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:35:40,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-17 00:35:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:40,062 INFO L225 Difference]: With dead ends: 43 [2024-11-17 00:35:40,062 INFO L226 Difference]: Without dead ends: 43 [2024-11-17 00:35:40,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-17 00:35:40,065 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:40,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:40,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-17 00:35:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-17 00:35:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:35:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-17 00:35:40,071 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 10 [2024-11-17 00:35:40,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:40,071 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-17 00:35:40,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-11-17 00:35:40,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:35:40,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:40,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:40,076 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-17 00:35:40,275 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-17 00:35:40,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:40,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash 48680753, now seen corresponding path program 1 times [2024-11-17 00:35:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792694430] [2024-11-17 00:35:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:40,279 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-17 00:35:40,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:40,288 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-17 00:35:40,290 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-17 00:35:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:40,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:35:40,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:40,360 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 5 [2024-11-17 00:35:40,443 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-17 00:35:40,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:40,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:40,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792694430] [2024-11-17 00:35:40,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792694430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:40,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:40,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:35:40,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83374935] [2024-11-17 00:35:40,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:40,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:35:40,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:40,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:35:40,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:35:40,446 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:40,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:40,595 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-17 00:35:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:35:40,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-17 00:35:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:40,596 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:35:40,596 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:35:40,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:35:40,598 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:40,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 126 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:35:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:35:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-17 00:35:40,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:35:40,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-17 00:35:40,606 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 11 [2024-11-17 00:35:40,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:40,606 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-17 00:35:40,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-17 00:35:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:35:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:40,618 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:40,625 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-17 00:35:40,818 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-17 00:35:40,819 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:40,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:40,820 INFO L85 PathProgramCache]: Analyzing trace with hash -465144466, now seen corresponding path program 1 times [2024-11-17 00:35:40,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:40,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181755876] [2024-11-17 00:35:40,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:40,820 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-17 00:35:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:40,822 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-17 00:35:40,824 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-17 00:35:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:40,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:35:40,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:40,883 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-17 00:35:40,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:40,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:40,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181755876] [2024-11-17 00:35:40,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181755876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:40,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:40,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:35:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650460779] [2024-11-17 00:35:40,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:40,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:35:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:40,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:35:40,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:35:40,886 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:40,904 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2024-11-17 00:35:40,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:35:40,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-17 00:35:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:40,905 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:35:40,905 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:35:40,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-17 00:35:40,907 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:40,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 129 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:35:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-17 00:35:40,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-17 00:35:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2024-11-17 00:35:40,911 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 13 [2024-11-17 00:35:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:40,911 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2024-11-17 00:35:40,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2024-11-17 00:35:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-17 00:35:40,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:40,912 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:40,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:35:41,112 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-17 00:35:41,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:41,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:41,114 INFO L85 PathProgramCache]: Analyzing trace with hash 2022368367, now seen corresponding path program 1 times [2024-11-17 00:35:41,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:41,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188433344] [2024-11-17 00:35:41,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:41,114 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-17 00:35:41,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:41,117 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-17 00:35:41,118 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-17 00:35:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:41,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:35:41,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:41,165 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-17 00:35:41,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:41,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:41,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188433344] [2024-11-17 00:35:41,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188433344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:41,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:41,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:35:41,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068329522] [2024-11-17 00:35:41,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:41,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:35:41,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:41,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:35:41,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:35:41,167 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:41,218 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2024-11-17 00:35:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:35:41,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-17 00:35:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:41,220 INFO L225 Difference]: With dead ends: 46 [2024-11-17 00:35:41,220 INFO L226 Difference]: Without dead ends: 38 [2024-11-17 00:35:41,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-17 00:35:41,221 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:41,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 80 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-17 00:35:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-17 00:35:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 34 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:41,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2024-11-17 00:35:41,224 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 13 [2024-11-17 00:35:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:41,224 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2024-11-17 00:35:41,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2024-11-17 00:35:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 00:35:41,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:41,225 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:41,233 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-17 00:35:41,426 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-17 00:35:41,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:41,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:41,428 INFO L85 PathProgramCache]: Analyzing trace with hash 287468424, now seen corresponding path program 1 times [2024-11-17 00:35:41,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:41,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1634253310] [2024-11-17 00:35:41,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:41,428 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-17 00:35:41,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:41,431 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-17 00:35:41,432 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-17 00:35:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:41,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:35:41,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:41,493 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-17 00:35:41,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:41,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1634253310] [2024-11-17 00:35:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1634253310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:41,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:35:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953180511] [2024-11-17 00:35:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:35:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:35:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:35:41,494 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:41,523 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-17 00:35:41,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:35:41,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-17 00:35:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:41,525 INFO L225 Difference]: With dead ends: 39 [2024-11-17 00:35:41,525 INFO L226 Difference]: Without dead ends: 39 [2024-11-17 00:35:41,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:35:41,529 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:41,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 70 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:41,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-17 00:35:41,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-17 00:35:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 35 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2024-11-17 00:35:41,536 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 17 [2024-11-17 00:35:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:41,536 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2024-11-17 00:35:41,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2024-11-17 00:35:41,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:35:41,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:41,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:41,541 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-17 00:35:41,737 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-17 00:35:41,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:41,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:41,738 INFO L85 PathProgramCache]: Analyzing trace with hash 294839245, now seen corresponding path program 1 times [2024-11-17 00:35:41,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:41,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799488353] [2024-11-17 00:35:41,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:41,739 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-17 00:35:41,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:41,741 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:41,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:35:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:41,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:35:41,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:35:41,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:35:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:35:41,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:41,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799488353] [2024-11-17 00:35:41,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799488353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:35:41,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:35:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:35:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564170352] [2024-11-17 00:35:41,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:35:41,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:35:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:41,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:35:41,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:35:41,863 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:41,916 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-17 00:35:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:35:41,916 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-17 00:35:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:41,917 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:35:41,917 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:35:41,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:35:41,918 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:41,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 170 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:41,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:35:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-17 00:35:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 38 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2024-11-17 00:35:41,925 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 18 [2024-11-17 00:35:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:41,925 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2024-11-17 00:35:41,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2024-11-17 00:35:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:35:41,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:41,926 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:41,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:35:42,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:42,127 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:42,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:42,127 INFO L85 PathProgramCache]: Analyzing trace with hash -442444600, now seen corresponding path program 2 times [2024-11-17 00:35:42,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666468620] [2024-11-17 00:35:42,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:35:42,128 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-17 00:35:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:42,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:42,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:35:42,177 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:35:42,177 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:35:42,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:35:42,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:42,183 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-17 00:35:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-17 00:35:42,240 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:42,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:42,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666468620] [2024-11-17 00:35:42,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666468620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:42,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:42,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:35:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623357978] [2024-11-17 00:35:42,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:42,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:35:42,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:42,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:35:42,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:35:42,241 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:42,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:42,401 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2024-11-17 00:35:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:35:42,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-17 00:35:42,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:42,404 INFO L225 Difference]: With dead ends: 42 [2024-11-17 00:35:42,404 INFO L226 Difference]: Without dead ends: 42 [2024-11-17 00:35:42,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:35:42,404 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 14 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:42,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 116 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:35:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-17 00:35:42,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-17 00:35:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 37 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2024-11-17 00:35:42,409 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 21 [2024-11-17 00:35:42,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:42,410 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2024-11-17 00:35:42,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2024-11-17 00:35:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:35:42,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:42,411 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:42,415 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 (9)] Ended with exit code 0 [2024-11-17 00:35:42,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:42,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:42,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:42,612 INFO L85 PathProgramCache]: Analyzing trace with hash -442444599, now seen corresponding path program 1 times [2024-11-17 00:35:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:42,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21717879] [2024-11-17 00:35:42,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:42,613 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-17 00:35:42,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:42,615 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:42,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:35:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:42,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:35:42,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:35:42,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:35:42,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:35:42,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21717879] [2024-11-17 00:35:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21717879] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:35:42,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:35:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:35:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449120757] [2024-11-17 00:35:42,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:35:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:35:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:42,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:35:42,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:35:42,850 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:43,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:43,001 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-17 00:35:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 00:35:43,001 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-17 00:35:43,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:43,002 INFO L225 Difference]: With dead ends: 47 [2024-11-17 00:35:43,002 INFO L226 Difference]: Without dead ends: 47 [2024-11-17 00:35:43,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-17 00:35:43,003 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 14 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:43,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 232 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:35:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-17 00:35:43,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-17 00:35:43,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 43 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-11-17 00:35:43,005 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 21 [2024-11-17 00:35:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:43,005 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-11-17 00:35:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-11-17 00:35:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:35:43,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:43,006 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:43,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 00:35:43,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:43,209 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:43,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1939146409, now seen corresponding path program 2 times [2024-11-17 00:35:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619515227] [2024-11-17 00:35:43,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:35:43,209 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-17 00:35:43,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:43,213 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:43,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-17 00:35:43,276 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:35:43,277 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:35:43,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 00:35:43,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:43,292 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 5 [2024-11-17 00:35:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-17 00:35:43,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:43,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:43,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619515227] [2024-11-17 00:35:43,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619515227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:43,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:43,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:35:43,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589290201] [2024-11-17 00:35:43,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:43,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:35:43,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:43,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:35:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:35:43,460 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:43,634 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2024-11-17 00:35:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:35:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-17 00:35:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:43,635 INFO L225 Difference]: With dead ends: 47 [2024-11-17 00:35:43,635 INFO L226 Difference]: Without dead ends: 47 [2024-11-17 00:35:43,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:35:43,635 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 12 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:43,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:35:43,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-17 00:35:43,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2024-11-17 00:35:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2024-11-17 00:35:43,638 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 27 [2024-11-17 00:35:43,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:43,638 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2024-11-17 00:35:43,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2024-11-17 00:35:43,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-17 00:35:43,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:43,639 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:43,646 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 (11)] Forceful destruction successful, exit code 0 [2024-11-17 00:35:43,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:43,839 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:43,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:43,840 INFO L85 PathProgramCache]: Analyzing trace with hash -19109235, now seen corresponding path program 1 times [2024-11-17 00:35:43,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528876805] [2024-11-17 00:35:43,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:43,840 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-17 00:35:43,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:43,842 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:43,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:35:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:43,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:35:43,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:35:44,073 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:35:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:35:44,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528876805] [2024-11-17 00:35:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528876805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:35:44,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:35:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:35:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196058765] [2024-11-17 00:35:44,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:35:44,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:35:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:35:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:35:44,351 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 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-17 00:35:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:44,658 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2024-11-17 00:35:44,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:35:44,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 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 31 [2024-11-17 00:35:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:44,659 INFO L225 Difference]: With dead ends: 52 [2024-11-17 00:35:44,659 INFO L226 Difference]: Without dead ends: 52 [2024-11-17 00:35:44,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=652, Unknown=0, NotChecked=0, Total=930 [2024-11-17 00:35:44,660 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 14 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:44,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 419 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:35:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-17 00:35:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-17 00:35:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 48 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-11-17 00:35:44,667 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 31 [2024-11-17 00:35:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:44,667 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-11-17 00:35:44,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 26 states have internal predecessors, (43), 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-17 00:35:44,667 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-11-17 00:35:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:35:44,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:44,669 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:44,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-17 00:35:44,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:44,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:44,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:44,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1172061075, now seen corresponding path program 2 times [2024-11-17 00:35:44,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:44,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404706411] [2024-11-17 00:35:44,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:35:44,871 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-17 00:35:44,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:44,872 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:44,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:35:44,944 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:35:44,944 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:35:44,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 00:35:44,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:44,953 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-17 00:35:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-17 00:35:45,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:45,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:45,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404706411] [2024-11-17 00:35:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404706411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:45,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:45,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 00:35:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570378658] [2024-11-17 00:35:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:45,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 00:35:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 00:35:45,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:35:45,033 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-17 00:35:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:45,202 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-11-17 00:35:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 00:35:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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 37 [2024-11-17 00:35:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:45,202 INFO L225 Difference]: With dead ends: 51 [2024-11-17 00:35:45,203 INFO L226 Difference]: Without dead ends: 51 [2024-11-17 00:35:45,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:35:45,203 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:45,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 104 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:35:45,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-17 00:35:45,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-11-17 00:35:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 46 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2024-11-17 00:35:45,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 37 [2024-11-17 00:35:45,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:45,206 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2024-11-17 00:35:45,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 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-17 00:35:45,206 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2024-11-17 00:35:45,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:35:45,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:45,208 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:45,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:35:45,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:45,413 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:45,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1172061074, now seen corresponding path program 1 times [2024-11-17 00:35:45,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:45,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970621512] [2024-11-17 00:35:45,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:45,414 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-17 00:35:45,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:45,417 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:35:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:45,567 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 00:35:45,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:45,588 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 5 [2024-11-17 00:35:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-17 00:35:45,840 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:45,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:45,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970621512] [2024-11-17 00:35:45,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1970621512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:45,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:45,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-17 00:35:45,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038757547] [2024-11-17 00:35:45,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:45,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 00:35:45,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:45,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 00:35:45,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:35:45,841 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-17 00:35:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:46,050 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2024-11-17 00:35:46,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:35:46,051 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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 37 [2024-11-17 00:35:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:46,051 INFO L225 Difference]: With dead ends: 49 [2024-11-17 00:35:46,051 INFO L226 Difference]: Without dead ends: 49 [2024-11-17 00:35:46,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-17 00:35:46,052 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:46,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 128 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:35:46,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-17 00:35:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-17 00:35:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 44 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-11-17 00:35:46,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 37 [2024-11-17 00:35:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:46,055 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-11-17 00:35:46,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 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-17 00:35:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-11-17 00:35:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 00:35:46,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:46,055 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:46,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 00:35:46,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:46,256 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:46,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 997597448, now seen corresponding path program 1 times [2024-11-17 00:35:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:46,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1956091897] [2024-11-17 00:35:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:46,257 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-17 00:35:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:46,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:46,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 00:35:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:46,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:35:46,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-17 00:35:46,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:46,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:46,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1956091897] [2024-11-17 00:35:46,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1956091897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:46,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:46,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 00:35:46,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127858464] [2024-11-17 00:35:46,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:35:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:46,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:35:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:35:46,421 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:46,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:46,441 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2024-11-17 00:35:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:35:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2024-11-17 00:35:46,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:46,442 INFO L225 Difference]: With dead ends: 47 [2024-11-17 00:35:46,442 INFO L226 Difference]: Without dead ends: 47 [2024-11-17 00:35:46,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:35:46,442 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:46,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 117 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:46,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-17 00:35:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-17 00:35:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 43 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-11-17 00:35:46,448 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 37 [2024-11-17 00:35:46,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:46,448 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-11-17 00:35:46,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:46,449 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-11-17 00:35:46,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-17 00:35:46,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:46,449 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:46,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 00:35:46,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:35:46,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:46,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash 452899844, now seen corresponding path program 1 times [2024-11-17 00:35:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:46,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776020214] [2024-11-17 00:35:46,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:46,651 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-17 00:35:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:46,652 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:35:46,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 00:35:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:35:46,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 00:35:46,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:35:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-17 00:35:46,805 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:35:46,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:35:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776020214] [2024-11-17 00:35:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776020214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:35:46,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:35:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:35:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616809686] [2024-11-17 00:35:46,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:35:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:35:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:35:46,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:35:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:35:46,807 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:46,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:35:46,842 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2024-11-17 00:35:46,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:35:46,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2024-11-17 00:35:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:35:46,842 INFO L225 Difference]: With dead ends: 47 [2024-11-17 00:35:46,842 INFO L226 Difference]: Without dead ends: 47 [2024-11-17 00:35:46,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-17 00:35:46,843 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:35:46,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 130 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:35:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-17 00:35:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-17 00:35:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 00:35:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2024-11-17 00:35:46,845 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 38 [2024-11-17 00:35:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:35:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2024-11-17 00:35:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 00:35:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2024-11-17 00:35:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-17 00:35:46,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:35:46,846 INFO L215 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:46,854 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 (16)] Forceful destruction successful, exit code 0 [2024-11-17 00:35:47,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-17 00:35:47,051 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2024-11-17 00:35:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:35:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1436542110, now seen corresponding path program 1 times [2024-11-17 00:35:47,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:35:47,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411550126] [2024-11-17 00:35:47,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:35:47,052 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-17 00:35:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:35:47,053 INFO L229 MonitoredProcess]: Starting monitored process 17 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-17 00:35:47,054 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 (17)] Waiting until timeout for monitored process [2024-11-17 00:35:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:35:47,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 00:35:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 00:35:47,441 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 00:35:47,442 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 00:35:47,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2024-11-17 00:35:47,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2024-11-17 00:35:47,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2024-11-17 00:35:47,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2024-11-17 00:35:47,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2024-11-17 00:35:47,444 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2024-11-17 00:35:47,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 9 remaining) [2024-11-17 00:35:47,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 9 remaining) [2024-11-17 00:35:47,445 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 9 remaining) [2024-11-17 00:35:47,452 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 (17)] Forceful destruction successful, exit code 0 [2024-11-17 00:35:47,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-17 00:35:47,648 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:35:47,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 00:35:47,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:35:47 BoogieIcfgContainer [2024-11-17 00:35:47,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 00:35:47,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 00:35:47,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 00:35:47,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 00:35:47,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:35:39" (3/4) ... [2024-11-17 00:35:47,675 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 00:35:47,676 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 00:35:47,676 INFO L158 Benchmark]: Toolchain (without parser) took 9646.97ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 42.4MB in the beginning and 79.6MB in the end (delta: -37.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-17 00:35:47,676 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 37.0MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:35:47,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.41ms. Allocated memory is still 77.6MB. Free memory was 42.1MB in the beginning and 30.7MB in the end (delta: 11.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-17 00:35:47,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 77.6MB. Free memory was 30.7MB in the beginning and 28.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 00:35:47,677 INFO L158 Benchmark]: Boogie Preprocessor took 49.70ms. Allocated memory is still 77.6MB. Free memory was 28.3MB in the beginning and 55.5MB in the end (delta: -27.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 00:35:47,677 INFO L158 Benchmark]: IcfgBuilder took 388.69ms. Allocated memory is still 77.6MB. Free memory was 55.5MB in the beginning and 37.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-17 00:35:47,677 INFO L158 Benchmark]: TraceAbstraction took 8630.80ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 36.7MB in the beginning and 79.6MB in the end (delta: -43.0MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. [2024-11-17 00:35:47,677 INFO L158 Benchmark]: Witness Printer took 3.31ms. Allocated memory is still 121.6MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:35:47,678 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.11ms. Allocated memory is still 54.5MB. Free memory was 37.1MB in the beginning and 37.0MB in the end (delta: 71.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.41ms. Allocated memory is still 77.6MB. Free memory was 42.1MB in the beginning and 30.7MB in the end (delta: 11.4MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 77.6MB. Free memory was 30.7MB in the beginning and 28.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.70ms. Allocated memory is still 77.6MB. Free memory was 28.3MB in the beginning and 55.5MB in the end (delta: -27.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 388.69ms. Allocated memory is still 77.6MB. Free memory was 55.5MB in the beginning and 37.5MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8630.80ms. Allocated memory was 77.6MB in the beginning and 121.6MB in the end (delta: 44.0MB). Free memory was 36.7MB in the beginning and 79.6MB in the end (delta: -43.0MB). Peak memory consumption was 1.8MB. Max. memory is 16.1GB. * Witness Printer took 3.31ms. Allocated memory is still 121.6MB. Free memory is still 79.6MB. There was no memory consumed. 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 - UnprovableResult [Line: 761]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 761. Possible 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) }; VAL [ldv_global_msg_list={1:0}] [L762] CALL entry_point() [L758] struct ldv_kobject *kobj; [L759] CALL, EXPR ldv_kobject_create() [L740] struct ldv_kobject *kobj; VAL [ldv_global_msg_list={1:0}] [L741] CALL, EXPR ldv_malloc(sizeof(*kobj)) VAL [\old(size)=16, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L741] RET, EXPR ldv_malloc(sizeof(*kobj)) VAL [ldv_global_msg_list={1:0}] [L741] kobj = ldv_malloc(sizeof(*kobj)) [L742] COND FALSE !(!kobj) [L744] FCALL memset(kobj, 0, sizeof(*kobj)) [L745] CALL ldv_kobject_init(kobj) [L730] COND FALSE !(!kobj) [L733] CALL ldv_kobject_init_internal(kobj) [L723] COND FALSE !(!kobj) [L725] CALL ldv_kref_init(&kobj->kref) [L682] ((&kref->refcount)->counter) = (1) VAL [ldv_global_msg_list={1:0}] [L725] RET ldv_kref_init(&kobj->kref) [L726] CALL LDV_INIT_LIST_HEAD(&kobj->entry) VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}] [L540] list->next = list VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}, list={2:4}] [L541] list->prev = list VAL [\old(list)={2:4}, ldv_global_msg_list={1:0}] [L726] RET LDV_INIT_LIST_HEAD(&kobj->entry) VAL [kobj={2:0}, ldv_global_msg_list={1:0}] [L733] RET ldv_kobject_init_internal(kobj) [L745] RET ldv_kobject_init(kobj) [L746] return kobj; VAL [\result={2:0}, ldv_global_msg_list={1:0}] [L759] RET, EXPR ldv_kobject_create() [L759] kobj = ldv_kobject_create() [L762] RET entry_point() - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 8.6s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 2250 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1194 IncrementalHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 467 mSDtfsCounter, 1194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 422 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=11, InterpolantAutomatonStates: 120, 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, 15 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 387 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 1642 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1650 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 609/741 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 could not prove your program: unable to determine feasibility of some traces [2024-11-17 00:35:47,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample