./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_5-container_of.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 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:35:50,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:35:50,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:35:50,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:35:50,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:35:50,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:35:50,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:35:50,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:35:50,493 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:35:50,494 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:35:50,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:35:50,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:35:50,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:35:50,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:35:50,495 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:35:50,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:35:50,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:35:50,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:35:50,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:35:50,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:35:50,497 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:35:50,497 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:35:50,498 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:35:50,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:35:50,498 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:35:50,499 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:35:50,499 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:35:50,499 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:35:50,499 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:35:50,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:35:50,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:35:50,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:35:50,500 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:35:50,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:50,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:35:50,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:35:50,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:35:50,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:35:50,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:35:50,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:35:50,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:35:50,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:35:50,505 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-11-19 09:35:50,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:35:50,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:35:50,743 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:35:50,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:35:50,745 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:35:50,746 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-19 09:35:52,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:35:52,265 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:35:52,266 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-19 09:35:52,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56883dfe7/24d741a6d6374514be89c3c056be8aac/FLAG2da28b744 [2024-11-19 09:35:52,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56883dfe7/24d741a6d6374514be89c3c056be8aac [2024-11-19 09:35:52,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:35:52,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:35:52,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:52,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:35:52,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:35:52,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d73ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:52, skipping insertion in model container [2024-11-19 09:35:52,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:52" (1/1) ... [2024-11-19 09:35:52,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:53,029 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:53,038 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:53,045 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:53,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:53,082 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 09:35:53,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@345eef45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:53, skipping insertion in model container [2024-11-19 09:35:53,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:53,083 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 09:35:53,085 INFO L158 Benchmark]: Toolchain (without parser) took 481.73ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 71.3MB in the beginning and 157.5MB in the end (delta: -86.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-19 09:35:53,085 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:35:53,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.50ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 71.1MB in the beginning and 157.5MB in the end (delta: -86.3MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-11-19 09:35:53,087 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.15ms. Allocated memory is still 146.8MB. Free memory is still 94.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.50ms. Allocated memory was 146.8MB in the beginning and 197.1MB in the end (delta: 50.3MB). Free memory was 71.1MB in the beginning and 157.5MB in the end (delta: -86.3MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: 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-races/race-2_5-container_of.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 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:35:54,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:35:54,890 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:35:54,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:35:54,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:35:54,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:35:54,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:35:54,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:35:54,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:35:54,924 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:35:54,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:35:54,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:35:54,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:35:54,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:35:54,926 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:35:54,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:35:54,926 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:35:54,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:35:54,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:35:54,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:35:54,927 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:35:54,928 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:35:54,928 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:35:54,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:35:54,930 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:35:54,931 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:35:54,931 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:35:54,931 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:35:54,931 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:35:54,931 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:35:54,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:35:54,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:35:54,932 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:35:54,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:35:54,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:35:54,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:54,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:35:54,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:35:54,932 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:35:54,933 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:35:54,933 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:35:54,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:35:54,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:35:54,935 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:35:54,935 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 -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-11-19 09:35:55,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:35:55,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:35:55,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:35:55,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:35:55,219 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:35:55,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-19 09:35:56,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:35:56,836 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:35:56,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-19 09:35:56,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143eb61ab/a8550f41a0fe4907be20513289b751b1/FLAG19dac6e2a [2024-11-19 09:35:57,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143eb61ab/a8550f41a0fe4907be20513289b751b1 [2024-11-19 09:35:57,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:35:57,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:35:57,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:57,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:35:57,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:35:57,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe517bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57, skipping insertion in model container [2024-11-19 09:35:57,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,243 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:57,595 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:57,625 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:57,637 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:57,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:57,668 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 09:35:57,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:35:57,712 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:57,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:57,720 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:35:57,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:57,735 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:35:57,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:35:57,867 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:35:57,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57 WrapperNode [2024-11-19 09:35:57,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:35:57,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:35:57,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:35:57,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:35:57,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,929 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-11-19 09:35:57,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:35:57,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:35:57,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:35:57,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:35:57,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,977 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 2, 8]. [2024-11-19 09:35:57,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:57,999 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:58,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:58,010 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:58,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:58,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:35:58,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:35:58,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:35:58,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:35:58,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (1/1) ... [2024-11-19 09:35:58,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:35:58,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:35:58,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:35:58,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:35:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:35:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:35:58,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-19 09:35:58,096 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:35:58,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:35:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:35:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:35:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:35:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:35:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:35:58,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:35:58,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:35:58,098 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:35:58,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:35:58,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:35:58,860 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:35:58,860 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:35:58,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:35:58,991 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:35:58,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:58 BoogieIcfgContainer [2024-11-19 09:35:58,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:35:58,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:35:58,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:35:58,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:35:58,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:35:57" (1/3) ... [2024-11-19 09:35:58,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684b07ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:35:58, skipping insertion in model container [2024-11-19 09:35:58,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:35:57" (2/3) ... [2024-11-19 09:35:58,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@684b07ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:35:58, skipping insertion in model container [2024-11-19 09:35:58,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:58" (3/3) ... [2024-11-19 09:35:58,999 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-11-19 09:35:59,016 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:35:59,016 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-19 09:35:59,016 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:35:59,075 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:35:59,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-11-19 09:35:59,176 INFO L124 PetriNetUnfolderBase]: 14/157 cut-off events. [2024-11-19 09:35:59,177 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:35:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 14/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 501 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-19 09:35:59,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-11-19 09:35:59,185 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-11-19 09:35:59,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:35:59,203 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;@38c3d25f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:35:59,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-19 09:35:59,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:35:59,210 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 09:35:59,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:35:59,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:35:59,211 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:35:59,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:35:59,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:35:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash 561254, now seen corresponding path program 1 times [2024-11-19 09:35:59,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:35:59,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894736362] [2024-11-19 09:35:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:35:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:35:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:35:59,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:35:59,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:35:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:35:59,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:35:59,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:35:59,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:35:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:35:59,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:35:59,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:35:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894736362] [2024-11-19 09:35:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894736362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:35:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:35:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:35:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209324034] [2024-11-19 09:35:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:35:59,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:35:59,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:35:59,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:35:59,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:35:59,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-19 09:35:59,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:35:59,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:35:59,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-19 09:35:59,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:00,904 INFO L124 PetriNetUnfolderBase]: 4409/10835 cut-off events. [2024-11-19 09:36:00,904 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-19 09:36:00,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 10835 events. 4409/10835 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 111305 event pairs, 559 based on Foata normal form. 792/8156 useless extension candidates. Maximal degree in co-relation 16922. Up to 6052 conditions per place. [2024-11-19 09:36:00,965 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-11-19 09:36:00,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 472 flow [2024-11-19 09:36:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:00,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:00,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-11-19 09:36:00,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-11-19 09:36:00,980 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 226 transitions. [2024-11-19 09:36:00,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 472 flow [2024-11-19 09:36:00,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:36:00,989 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-19 09:36:00,991 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-11-19 09:36:00,995 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-11-19 09:36:00,996 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-19 09:36:00,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:00,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:00,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:36:01,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 09:36:01,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:01,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash 561255, now seen corresponding path program 1 times [2024-11-19 09:36:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:01,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595739685] [2024-11-19 09:36:01,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:01,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:01,204 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:36:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:01,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:36:01,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:01,318 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-19 09:36:01,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:01,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:01,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595739685] [2024-11-19 09:36:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595739685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:01,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463802273] [2024-11-19 09:36:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:01,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:01,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:01,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-19 09:36:01,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:01,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:01,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-19 09:36:01,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:02,416 INFO L124 PetriNetUnfolderBase]: 4409/10833 cut-off events. [2024-11-19 09:36:02,417 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-19 09:36:02,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18083 conditions, 10833 events. 4409/10833 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 111595 event pairs, 559 based on Foata normal form. 1/7363 useless extension candidates. Maximal degree in co-relation 1994. Up to 6052 conditions per place. [2024-11-19 09:36:02,475 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-11-19 09:36:02,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 462 flow [2024-11-19 09:36:02,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-11-19 09:36:02,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-11-19 09:36:02,482 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 220 transitions. [2024-11-19 09:36:02,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 462 flow [2024-11-19 09:36:02,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:02,485 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-11-19 09:36:02,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2024-11-19 09:36:02,486 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-19 09:36:02,486 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-11-19 09:36:02,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:02,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:02,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:36:02,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:36:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:02,695 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:02,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:02,696 INFO L85 PathProgramCache]: Analyzing trace with hash 17397141, now seen corresponding path program 1 times [2024-11-19 09:36:02,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:02,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797613207] [2024-11-19 09:36:02,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:02,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:02,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:02,698 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:02,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:36:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:02,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:36:02,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:02,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:02,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:02,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797613207] [2024-11-19 09:36:02,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797613207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:02,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:02,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659759047] [2024-11-19 09:36:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:02,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:02,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-19 09:36:02,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:02,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:02,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-19 09:36:02,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:03,559 INFO L124 PetriNetUnfolderBase]: 4408/8077 cut-off events. [2024-11-19 09:36:03,560 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-11-19 09:36:03,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15327 conditions, 8077 events. 4408/8077 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 62053 event pairs, 4043 based on Foata normal form. 1/5576 useless extension candidates. Maximal degree in co-relation 7647. Up to 6473 conditions per place. [2024-11-19 09:36:03,603 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-19 09:36:03,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 460 flow [2024-11-19 09:36:03,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-11-19 09:36:03,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2024-11-19 09:36:03,605 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 222 transitions. [2024-11-19 09:36:03,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 460 flow [2024-11-19 09:36:03,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:03,609 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-11-19 09:36:03,609 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2024-11-19 09:36:03,609 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-19 09:36:03,610 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-11-19 09:36:03,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:03,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:03,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:03,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 09:36:03,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:03,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:03,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1675627661, now seen corresponding path program 1 times [2024-11-19 09:36:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500094392] [2024-11-19 09:36:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:03,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:03,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:03,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:03,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:36:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:03,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:36:03,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:03,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:03,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:03,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:03,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500094392] [2024-11-19 09:36:03,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500094392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105137534] [2024-11-19 09:36:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:03,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:03,985 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-11-19 09:36:03,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:03,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:03,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-11-19 09:36:03,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:04,826 INFO L124 PetriNetUnfolderBase]: 5136/9326 cut-off events. [2024-11-19 09:36:04,826 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-19 09:36:04,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17699 conditions, 9326 events. 5136/9326 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 71026 event pairs, 4407 based on Foata normal form. 0/6615 useless extension candidates. Maximal degree in co-relation 16374. Up to 7032 conditions per place. [2024-11-19 09:36:04,870 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 94 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2024-11-19 09:36:04,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 126 transitions, 456 flow [2024-11-19 09:36:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-19 09:36:04,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-11-19 09:36:04,872 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 3 states and 208 transitions. [2024-11-19 09:36:04,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 126 transitions, 456 flow [2024-11-19 09:36:04,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:04,883 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 212 flow [2024-11-19 09:36:04,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2024-11-19 09:36:04,883 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -15 predicate places. [2024-11-19 09:36:04,884 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 212 flow [2024-11-19 09:36:04,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:04,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:04,884 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:04,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:05,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:05,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:05,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:05,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1675627662, now seen corresponding path program 1 times [2024-11-19 09:36:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:05,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885927690] [2024-11-19 09:36:05,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:05,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:05,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:05,088 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:05,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:36:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:05,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:36:05,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:05,205 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-19 09:36:05,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:05,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:05,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:05,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885927690] [2024-11-19 09:36:05,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885927690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:05,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:05,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:05,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168468494] [2024-11-19 09:36:05,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:05,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:05,313 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 124 [2024-11-19 09:36:05,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:05,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:05,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 124 [2024-11-19 09:36:05,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:05,920 INFO L124 PetriNetUnfolderBase]: 4408/8143 cut-off events. [2024-11-19 09:36:05,920 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-11-19 09:36:05,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15409 conditions, 8143 events. 4408/8143 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 62979 event pairs, 3107 based on Foata normal form. 394/6163 useless extension candidates. Maximal degree in co-relation 12508. Up to 4910 conditions per place. [2024-11-19 09:36:05,957 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 105 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2024-11-19 09:36:05,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 133 transitions, 496 flow [2024-11-19 09:36:05,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:05,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-11-19 09:36:05,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5994623655913979 [2024-11-19 09:36:05,959 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 212 flow. Second operand 3 states and 223 transitions. [2024-11-19 09:36:05,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 133 transitions, 496 flow [2024-11-19 09:36:05,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 133 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:05,966 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 225 flow [2024-11-19 09:36:05,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2024-11-19 09:36:05,967 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -14 predicate places. [2024-11-19 09:36:05,967 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 225 flow [2024-11-19 09:36:05,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:05,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:05,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:05,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:36:06,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:06,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:06,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash 480476947, now seen corresponding path program 1 times [2024-11-19 09:36:06,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:06,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278011700] [2024-11-19 09:36:06,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:06,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:06,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:06,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:06,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:36:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:06,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:36:06,272 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:06,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:06,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:06,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:06,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278011700] [2024-11-19 09:36:06,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278011700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:06,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:06,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:06,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69190691] [2024-11-19 09:36:06,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:06,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:06,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:06,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:06,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:06,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:06,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:06,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:06,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:06,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:07,432 INFO L124 PetriNetUnfolderBase]: 3844/8036 cut-off events. [2024-11-19 09:36:07,433 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-11-19 09:36:07,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14925 conditions, 8036 events. 3844/8036 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 68062 event pairs, 55 based on Foata normal form. 0/6221 useless extension candidates. Maximal degree in co-relation 9104. Up to 3713 conditions per place. [2024-11-19 09:36:07,467 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 169 selfloop transitions, 13 changer transitions 1/214 dead transitions. [2024-11-19 09:36:07,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 214 transitions, 830 flow [2024-11-19 09:36:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:36:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:36:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 534 transitions. [2024-11-19 09:36:07,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5383064516129032 [2024-11-19 09:36:07,469 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 225 flow. Second operand 8 states and 534 transitions. [2024-11-19 09:36:07,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 214 transitions, 830 flow [2024-11-19 09:36:07,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 214 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:36:07,479 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 313 flow [2024-11-19 09:36:07,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2024-11-19 09:36:07,482 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2024-11-19 09:36:07,482 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 313 flow [2024-11-19 09:36:07,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:07,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:07,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:07,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:36:07,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:07,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:07,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:07,690 INFO L85 PathProgramCache]: Analyzing trace with hash 480476948, now seen corresponding path program 1 times [2024-11-19 09:36:07,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:07,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306194417] [2024-11-19 09:36:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:07,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:07,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:36:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:07,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:36:07,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:07,822 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-19 09:36:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:07,892 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:07,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:07,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306194417] [2024-11-19 09:36:07,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306194417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:07,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:07,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:07,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106779188] [2024-11-19 09:36:07,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:07,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:07,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:07,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:07,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:08,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:08,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:08,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:08,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:08,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:09,094 INFO L124 PetriNetUnfolderBase]: 2867/6073 cut-off events. [2024-11-19 09:36:09,094 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-11-19 09:36:09,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12538 conditions, 6073 events. 2867/6073 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48858 event pairs, 125 based on Foata normal form. 524/5654 useless extension candidates. Maximal degree in co-relation 11075. Up to 3099 conditions per place. [2024-11-19 09:36:09,125 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 151 selfloop transitions, 10 changer transitions 2/194 dead transitions. [2024-11-19 09:36:09,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 194 transitions, 827 flow [2024-11-19 09:36:09,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:36:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:36:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 465 transitions. [2024-11-19 09:36:09,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-11-19 09:36:09,127 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 313 flow. Second operand 7 states and 465 transitions. [2024-11-19 09:36:09,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 194 transitions, 827 flow [2024-11-19 09:36:09,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:36:09,146 INFO L231 Difference]: Finished difference. Result has 123 places, 112 transitions, 366 flow [2024-11-19 09:36:09,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=123, PETRI_TRANSITIONS=112} [2024-11-19 09:36:09,149 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2024-11-19 09:36:09,149 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 112 transitions, 366 flow [2024-11-19 09:36:09,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:09,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:09,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:09,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:36:09,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:09,354 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:09,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:09,354 INFO L85 PathProgramCache]: Analyzing trace with hash 458561999, now seen corresponding path program 1 times [2024-11-19 09:36:09,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:09,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109432568] [2024-11-19 09:36:09,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:09,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:09,359 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-19 09:36:09,362 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-19 09:36:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:09,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:36:09,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:09,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:09,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:09,554 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:09,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:09,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109432568] [2024-11-19 09:36:09,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109432568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:09,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:09,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045139528] [2024-11-19 09:36:09,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:09,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:09,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:09,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:09,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:09,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 112 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:09,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:09,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:09,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:10,677 INFO L124 PetriNetUnfolderBase]: 2636/5484 cut-off events. [2024-11-19 09:36:10,678 INFO L125 PetriNetUnfolderBase]: For 3778/3778 co-relation queries the response was YES. [2024-11-19 09:36:10,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12310 conditions, 5484 events. 2636/5484 cut-off events. For 3778/3778 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 42612 event pairs, 191 based on Foata normal form. 0/4807 useless extension candidates. Maximal degree in co-relation 10986. Up to 2221 conditions per place. [2024-11-19 09:36:10,701 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 174 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-11-19 09:36:10,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 222 transitions, 1105 flow [2024-11-19 09:36:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:36:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:36:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2024-11-19 09:36:10,707 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2024-11-19 09:36:10,707 INFO L175 Difference]: Start difference. First operand has 123 places, 112 transitions, 366 flow. Second operand 8 states and 530 transitions. [2024-11-19 09:36:10,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 222 transitions, 1105 flow [2024-11-19 09:36:10,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 222 transitions, 1075 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:36:10,717 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 469 flow [2024-11-19 09:36:10,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=469, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-11-19 09:36:10,717 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2024-11-19 09:36:10,718 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 469 flow [2024-11-19 09:36:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:10,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:10,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:10,724 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-19 09:36:10,918 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-19 09:36:10,919 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 458562000, now seen corresponding path program 1 times [2024-11-19 09:36:10,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422159339] [2024-11-19 09:36:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:10,921 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:10,922 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-19 09:36:10,923 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-19 09:36:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:11,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:36:11,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:11,039 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-19 09:36:11,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:11,111 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:11,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:11,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422159339] [2024-11-19 09:36:11,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422159339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:11,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:11,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:11,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672151255] [2024-11-19 09:36:11,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:11,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:11,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:11,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:11,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:11,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:11,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:12,051 INFO L124 PetriNetUnfolderBase]: 1987/4195 cut-off events. [2024-11-19 09:36:12,051 INFO L125 PetriNetUnfolderBase]: For 4454/4456 co-relation queries the response was YES. [2024-11-19 09:36:12,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10529 conditions, 4195 events. 1987/4195 cut-off events. For 4454/4456 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 30960 event pairs, 384 based on Foata normal form. 378/4449 useless extension candidates. Maximal degree in co-relation 9449. Up to 2291 conditions per place. [2024-11-19 09:36:12,067 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 145 selfloop transitions, 14 changer transitions 1/191 dead transitions. [2024-11-19 09:36:12,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 191 transitions, 1027 flow [2024-11-19 09:36:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:36:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:36:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 448 transitions. [2024-11-19 09:36:12,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-11-19 09:36:12,069 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 469 flow. Second operand 7 states and 448 transitions. [2024-11-19 09:36:12,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 191 transitions, 1027 flow [2024-11-19 09:36:12,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 191 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:36:12,077 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 540 flow [2024-11-19 09:36:12,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2024-11-19 09:36:12,079 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2024-11-19 09:36:12,079 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 540 flow [2024-11-19 09:36:12,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:12,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:12,079 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:12,084 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:12,281 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-19 09:36:12,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:12,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1841625201, now seen corresponding path program 1 times [2024-11-19 09:36:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457057162] [2024-11-19 09:36:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:12,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:12,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:12,284 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-19 09:36:12,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:36:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:12,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:36:12,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:12,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,440 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-19 09:36:12,480 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,481 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:12,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:36:12,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2024-11-19 09:36:12,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:36:12,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 65 [2024-11-19 09:36:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:12,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:12,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:12,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457057162] [2024-11-19 09:36:12,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457057162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:12,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:12,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:36:12,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877352751] [2024-11-19 09:36:12,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:12,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:12,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:12,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:36:12,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-19 09:36:12,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:12,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:12,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-19 09:36:12,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:14,948 INFO L124 PetriNetUnfolderBase]: 2833/5364 cut-off events. [2024-11-19 09:36:14,948 INFO L125 PetriNetUnfolderBase]: For 9062/9066 co-relation queries the response was YES. [2024-11-19 09:36:14,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14860 conditions, 5364 events. 2833/5364 cut-off events. For 9062/9066 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 38454 event pairs, 1545 based on Foata normal form. 244/5468 useless extension candidates. Maximal degree in co-relation 13301. Up to 3777 conditions per place. [2024-11-19 09:36:15,007 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 136 selfloop transitions, 27 changer transitions 0/191 dead transitions. [2024-11-19 09:36:15,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 191 transitions, 1156 flow [2024-11-19 09:36:15,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:36:15,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:36:15,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 379 transitions. [2024-11-19 09:36:15,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5094086021505376 [2024-11-19 09:36:15,009 INFO L175 Difference]: Start difference. First operand has 137 places, 124 transitions, 540 flow. Second operand 6 states and 379 transitions. [2024-11-19 09:36:15,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 191 transitions, 1156 flow [2024-11-19 09:36:15,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 191 transitions, 1131 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 09:36:15,017 INFO L231 Difference]: Finished difference. Result has 141 places, 151 transitions, 788 flow [2024-11-19 09:36:15,017 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=141, PETRI_TRANSITIONS=151} [2024-11-19 09:36:15,018 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-11-19 09:36:15,018 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 151 transitions, 788 flow [2024-11-19 09:36:15,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:15,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:15,018 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:15,025 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-19 09:36:15,219 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-19 09:36:15,219 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:15,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2028696617, now seen corresponding path program 1 times [2024-11-19 09:36:15,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:15,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715643534] [2024-11-19 09:36:15,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:15,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:15,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:15,221 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-19 09:36:15,222 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-19 09:36:15,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:15,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 09:36:15,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:15,382 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-19 09:36:15,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:15,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:15,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:36:15,515 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:36:15,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:36:15,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:15,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:15,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:15,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715643534] [2024-11-19 09:36:15,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715643534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:15,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:15,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:36:15,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502470774] [2024-11-19 09:36:15,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:15,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:36:15,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:15,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:36:15,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:36:15,942 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:15,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 151 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:15,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:15,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:15,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:17,022 INFO L124 PetriNetUnfolderBase]: 2928/5803 cut-off events. [2024-11-19 09:36:17,023 INFO L125 PetriNetUnfolderBase]: For 10435/10441 co-relation queries the response was YES. [2024-11-19 09:36:17,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17915 conditions, 5803 events. 2928/5803 cut-off events. For 10435/10441 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 43896 event pairs, 607 based on Foata normal form. 39/5718 useless extension candidates. Maximal degree in co-relation 16083. Up to 2515 conditions per place. [2024-11-19 09:36:17,060 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 195 selfloop transitions, 24 changer transitions 0/251 dead transitions. [2024-11-19 09:36:17,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 251 transitions, 1673 flow [2024-11-19 09:36:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:36:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:36:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 557 transitions. [2024-11-19 09:36:17,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49910394265232977 [2024-11-19 09:36:17,062 INFO L175 Difference]: Start difference. First operand has 141 places, 151 transitions, 788 flow. Second operand 9 states and 557 transitions. [2024-11-19 09:36:17,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 251 transitions, 1673 flow [2024-11-19 09:36:17,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 251 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:17,093 INFO L231 Difference]: Finished difference. Result has 145 places, 149 transitions, 827 flow [2024-11-19 09:36:17,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=827, PETRI_PLACES=145, PETRI_TRANSITIONS=149} [2024-11-19 09:36:17,094 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-11-19 09:36:17,094 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 149 transitions, 827 flow [2024-11-19 09:36:17,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:17,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:17,094 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:17,101 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 (12)] Ended with exit code 0 [2024-11-19 09:36:17,294 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-19 09:36:17,295 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:17,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:17,295 INFO L85 PathProgramCache]: Analyzing trace with hash -31356965, now seen corresponding path program 1 times [2024-11-19 09:36:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:17,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100470623] [2024-11-19 09:36:17,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:17,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:17,297 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-19 09:36:17,299 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-19 09:36:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:17,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 09:36:17,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:17,459 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-19 09:36:17,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:17,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:17,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:36:17,585 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:36:17,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:36:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:17,599 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:17,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:17,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100470623] [2024-11-19 09:36:17,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100470623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:17,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:17,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:36:17,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479967715] [2024-11-19 09:36:17,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:17,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:36:17,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:17,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:36:17,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:36:17,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:17,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 149 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:17,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:17,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:17,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:19,069 INFO L124 PetriNetUnfolderBase]: 3340/6550 cut-off events. [2024-11-19 09:36:19,069 INFO L125 PetriNetUnfolderBase]: For 13997/14001 co-relation queries the response was YES. [2024-11-19 09:36:19,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20566 conditions, 6550 events. 3340/6550 cut-off events. For 13997/14001 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 50933 event pairs, 883 based on Foata normal form. 76/6535 useless extension candidates. Maximal degree in co-relation 17640. Up to 2361 conditions per place. [2024-11-19 09:36:19,103 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 213 selfloop transitions, 24 changer transitions 0/269 dead transitions. [2024-11-19 09:36:19,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 269 transitions, 1822 flow [2024-11-19 09:36:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:36:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:36:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 572 transitions. [2024-11-19 09:36:19,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-11-19 09:36:19,105 INFO L175 Difference]: Start difference. First operand has 145 places, 149 transitions, 827 flow. Second operand 9 states and 572 transitions. [2024-11-19 09:36:19,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 269 transitions, 1822 flow [2024-11-19 09:36:19,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 269 transitions, 1770 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:36:19,139 INFO L231 Difference]: Finished difference. Result has 143 places, 147 transitions, 831 flow [2024-11-19 09:36:19,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=831, PETRI_PLACES=143, PETRI_TRANSITIONS=147} [2024-11-19 09:36:19,140 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-19 09:36:19,140 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 147 transitions, 831 flow [2024-11-19 09:36:19,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:19,140 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:19,140 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:19,146 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-19 09:36:19,341 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-19 09:36:19,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:19,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1783923114, now seen corresponding path program 1 times [2024-11-19 09:36:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170030603] [2024-11-19 09:36:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:19,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:19,343 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-19 09:36:19,344 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-19 09:36:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:19,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:36:19,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:19,575 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_89| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89| (_ bv0 1))))) is different from true [2024-11-19 09:36:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:19,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:19,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:19,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170030603] [2024-11-19 09:36:19,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170030603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:19,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:19,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:36:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668740873] [2024-11-19 09:36:19,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:19,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:36:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:19,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:36:19,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-19 09:36:19,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 124 [2024-11-19 09:36:19,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 147 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:19,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:19,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 124 [2024-11-19 09:36:19,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:20,594 INFO L124 PetriNetUnfolderBase]: 3630/6717 cut-off events. [2024-11-19 09:36:20,594 INFO L125 PetriNetUnfolderBase]: For 16275/16277 co-relation queries the response was YES. [2024-11-19 09:36:20,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22018 conditions, 6717 events. 3630/6717 cut-off events. For 16275/16277 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 49758 event pairs, 1548 based on Foata normal form. 1/6615 useless extension candidates. Maximal degree in co-relation 19043. Up to 2794 conditions per place. [2024-11-19 09:36:20,626 INFO L140 encePairwiseOnDemand]: 98/124 looper letters, 138 selfloop transitions, 37 changer transitions 4/197 dead transitions. [2024-11-19 09:36:20,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 197 transitions, 1422 flow [2024-11-19 09:36:20,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:36:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:36:20,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2024-11-19 09:36:20,628 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-11-19 09:36:20,628 INFO L175 Difference]: Start difference. First operand has 143 places, 147 transitions, 831 flow. Second operand 5 states and 250 transitions. [2024-11-19 09:36:20,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 197 transitions, 1422 flow [2024-11-19 09:36:20,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 197 transitions, 1387 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:36:20,666 INFO L231 Difference]: Finished difference. Result has 144 places, 165 transitions, 1083 flow [2024-11-19 09:36:20,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1083, PETRI_PLACES=144, PETRI_TRANSITIONS=165} [2024-11-19 09:36:20,667 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-19 09:36:20,667 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 165 transitions, 1083 flow [2024-11-19 09:36:20,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:20,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:20,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:20,678 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-19 09:36:20,868 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-19 09:36:20,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:20,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:20,868 INFO L85 PathProgramCache]: Analyzing trace with hash 714340402, now seen corresponding path program 1 times [2024-11-19 09:36:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:20,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1844662115] [2024-11-19 09:36:20,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:20,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:20,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:20,870 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-19 09:36:20,871 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-19 09:36:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:20,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:36:20,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:20,998 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-19 09:36:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:21,011 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:21,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:21,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1844662115] [2024-11-19 09:36:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1844662115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:21,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294339962] [2024-11-19 09:36:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:21,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:21,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-19 09:36:21,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 165 transitions, 1083 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:21,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:21,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-19 09:36:21,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:21,809 INFO L124 PetriNetUnfolderBase]: 3428/6437 cut-off events. [2024-11-19 09:36:21,809 INFO L125 PetriNetUnfolderBase]: For 19141/19177 co-relation queries the response was YES. [2024-11-19 09:36:21,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24914 conditions, 6437 events. 3428/6437 cut-off events. For 19141/19177 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 48174 event pairs, 1949 based on Foata normal form. 17/6327 useless extension candidates. Maximal degree in co-relation 21739. Up to 5351 conditions per place. [2024-11-19 09:36:21,837 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 140 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-11-19 09:36:21,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 175 transitions, 1425 flow [2024-11-19 09:36:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:21,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2024-11-19 09:36:21,839 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-11-19 09:36:21,839 INFO L175 Difference]: Start difference. First operand has 144 places, 165 transitions, 1083 flow. Second operand 3 states and 201 transitions. [2024-11-19 09:36:21,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 175 transitions, 1425 flow [2024-11-19 09:36:21,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 175 transitions, 1344 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-11-19 09:36:21,882 INFO L231 Difference]: Finished difference. Result has 140 places, 163 transitions, 1008 flow [2024-11-19 09:36:21,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=140, PETRI_TRANSITIONS=163} [2024-11-19 09:36:21,883 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-19 09:36:21,883 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 163 transitions, 1008 flow [2024-11-19 09:36:21,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:21,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:21,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:21,889 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 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:22,083 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-19 09:36:22,084 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:22,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:22,084 INFO L85 PathProgramCache]: Analyzing trace with hash 714340401, now seen corresponding path program 1 times [2024-11-19 09:36:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304563744] [2024-11-19 09:36:22,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:22,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:22,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:22,086 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-19 09:36:22,087 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-19 09:36:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:22,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:36:22,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:22,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:22,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:22,224 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:22,224 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304563744] [2024-11-19 09:36:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304563744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665380448] [2024-11-19 09:36:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:22,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:22,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-19 09:36:22,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 163 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:22,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:22,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-19 09:36:22,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:23,026 INFO L124 PetriNetUnfolderBase]: 3428/6420 cut-off events. [2024-11-19 09:36:23,026 INFO L125 PetriNetUnfolderBase]: For 17407/17467 co-relation queries the response was YES. [2024-11-19 09:36:23,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24527 conditions, 6420 events. 3428/6420 cut-off events. For 17407/17467 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 47355 event pairs, 1989 based on Foata normal form. 25/6318 useless extension candidates. Maximal degree in co-relation 23138. Up to 5351 conditions per place. [2024-11-19 09:36:23,062 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 140 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2024-11-19 09:36:23,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 173 transitions, 1350 flow [2024-11-19 09:36:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2024-11-19 09:36:23,063 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-11-19 09:36:23,064 INFO L175 Difference]: Start difference. First operand has 140 places, 163 transitions, 1008 flow. Second operand 3 states and 201 transitions. [2024-11-19 09:36:23,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 173 transitions, 1350 flow [2024-11-19 09:36:23,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 173 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:23,115 INFO L231 Difference]: Finished difference. Result has 138 places, 161 transitions, 1004 flow [2024-11-19 09:36:23,116 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1004, PETRI_PLACES=138, PETRI_TRANSITIONS=161} [2024-11-19 09:36:23,116 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2024-11-19 09:36:23,116 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 161 transitions, 1004 flow [2024-11-19 09:36:23,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:23,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:23,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:23,122 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 (16)] Ended with exit code 0 [2024-11-19 09:36:23,317 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-19 09:36:23,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash 669716591, now seen corresponding path program 1 times [2024-11-19 09:36:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404348388] [2024-11-19 09:36:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:23,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:23,319 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-19 09:36:23,320 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-19 09:36:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:23,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:36:23,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:23,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:23,568 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:36:23,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 09:36:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:23,603 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:23,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:23,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404348388] [2024-11-19 09:36:23,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404348388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:23,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:23,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:36:23,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791797511] [2024-11-19 09:36:23,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:23,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:36:23,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:23,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:36:23,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:36:23,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-11-19 09:36:23,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 161 transitions, 1004 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:23,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:23,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-11-19 09:36:23,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:24,947 INFO L124 PetriNetUnfolderBase]: 3595/6649 cut-off events. [2024-11-19 09:36:24,947 INFO L125 PetriNetUnfolderBase]: For 17746/17772 co-relation queries the response was YES. [2024-11-19 09:36:24,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25363 conditions, 6649 events. 3595/6649 cut-off events. For 17746/17772 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 48525 event pairs, 1868 based on Foata normal form. 9/6598 useless extension candidates. Maximal degree in co-relation 24131. Up to 3143 conditions per place. [2024-11-19 09:36:24,985 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 137 selfloop transitions, 18 changer transitions 0/179 dead transitions. [2024-11-19 09:36:24,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 179 transitions, 1406 flow [2024-11-19 09:36:24,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:36:24,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:36:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2024-11-19 09:36:24,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46975806451612906 [2024-11-19 09:36:24,986 INFO L175 Difference]: Start difference. First operand has 138 places, 161 transitions, 1004 flow. Second operand 4 states and 233 transitions. [2024-11-19 09:36:24,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 179 transitions, 1406 flow [2024-11-19 09:36:25,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 179 transitions, 1396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:25,037 INFO L231 Difference]: Finished difference. Result has 135 places, 157 transitions, 1022 flow [2024-11-19 09:36:25,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1022, PETRI_PLACES=135, PETRI_TRANSITIONS=157} [2024-11-19 09:36:25,037 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2024-11-19 09:36:25,037 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 157 transitions, 1022 flow [2024-11-19 09:36:25,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:25,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:25,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:25,048 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-19 09:36:25,238 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-19 09:36:25,238 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:25,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:25,239 INFO L85 PathProgramCache]: Analyzing trace with hash 669716592, now seen corresponding path program 1 times [2024-11-19 09:36:25,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:25,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719803012] [2024-11-19 09:36:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:25,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:25,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:25,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:25,241 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 (18)] Waiting until timeout for monitored process [2024-11-19 09:36:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:25,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:36:25,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:25,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:36:25,459 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-19 09:36:25,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:25,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:36:25,568 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:36:25,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:36:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:25,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:25,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719803012] [2024-11-19 09:36:25,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719803012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:25,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:25,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:36:25,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896887225] [2024-11-19 09:36:25,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:25,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:36:25,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:25,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:36:25,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:36:25,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 124 [2024-11-19 09:36:25,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 157 transitions, 1022 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:25,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:25,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 124 [2024-11-19 09:36:25,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:26,465 INFO L124 PetriNetUnfolderBase]: 3372/6308 cut-off events. [2024-11-19 09:36:26,466 INFO L125 PetriNetUnfolderBase]: For 19073/19133 co-relation queries the response was YES. [2024-11-19 09:36:26,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24399 conditions, 6308 events. 3372/6308 cut-off events. For 19073/19133 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 46665 event pairs, 1740 based on Foata normal form. 24/6268 useless extension candidates. Maximal degree in co-relation 21169. Up to 3035 conditions per place. [2024-11-19 09:36:26,507 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 142 selfloop transitions, 16 changer transitions 0/179 dead transitions. [2024-11-19 09:36:26,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 179 transitions, 1450 flow [2024-11-19 09:36:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:36:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:36:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2024-11-19 09:36:26,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4475806451612903 [2024-11-19 09:36:26,508 INFO L175 Difference]: Start difference. First operand has 135 places, 157 transitions, 1022 flow. Second operand 4 states and 222 transitions. [2024-11-19 09:36:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 179 transitions, 1450 flow [2024-11-19 09:36:26,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 179 transitions, 1414 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:36:26,559 INFO L231 Difference]: Finished difference. Result has 131 places, 153 transitions, 1010 flow [2024-11-19 09:36:26,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1010, PETRI_PLACES=131, PETRI_TRANSITIONS=153} [2024-11-19 09:36:26,560 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-19 09:36:26,560 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 153 transitions, 1010 flow [2024-11-19 09:36:26,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:26,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:26,560 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:26,569 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 (18)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:26,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:26,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1847745221, now seen corresponding path program 1 times [2024-11-19 09:36:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660358336] [2024-11-19 09:36:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:26,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:26,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:26,766 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:26,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:36:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:26,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:36:26,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:26,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:26,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660358336] [2024-11-19 09:36:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660358336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:26,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:36:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825010969] [2024-11-19 09:36:26,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:36:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:26,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:36:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:36:26,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-19 09:36:26,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 153 transitions, 1010 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:26,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-19 09:36:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:27,198 INFO L124 PetriNetUnfolderBase]: 455/835 cut-off events. [2024-11-19 09:36:27,198 INFO L125 PetriNetUnfolderBase]: For 1426/1426 co-relation queries the response was YES. [2024-11-19 09:36:27,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 835 events. 455/835 cut-off events. For 1426/1426 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3408 event pairs, 63 based on Foata normal form. 64/881 useless extension candidates. Maximal degree in co-relation 2917. Up to 484 conditions per place. [2024-11-19 09:36:27,202 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 75 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-11-19 09:36:27,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 103 transitions, 623 flow [2024-11-19 09:36:27,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:36:27,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:36:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2024-11-19 09:36:27,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2024-11-19 09:36:27,203 INFO L175 Difference]: Start difference. First operand has 131 places, 153 transitions, 1010 flow. Second operand 4 states and 242 transitions. [2024-11-19 09:36:27,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 103 transitions, 623 flow [2024-11-19 09:36:27,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 103 transitions, 478 flow, removed 25 selfloop flow, removed 26 redundant places. [2024-11-19 09:36:27,207 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 234 flow [2024-11-19 09:36:27,208 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-11-19 09:36:27,208 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -29 predicate places. [2024-11-19 09:36:27,208 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 234 flow [2024-11-19 09:36:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:27,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:27,208 INFO L204 CegarLoopForPetriNet]: trace histogram [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-19 09:36:27,216 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 (19)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:27,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:27,409 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:27,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:27,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2090228439, now seen corresponding path program 1 times [2024-11-19 09:36:27,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:27,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292112140] [2024-11-19 09:36:27,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:27,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:27,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:27,413 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:27,414 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 (20)] Waiting until timeout for monitored process [2024-11-19 09:36:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:27,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:36:27,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:27,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:27,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:27,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:27,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:27,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:27,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-19 09:36:27,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:36:27,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 53 [2024-11-19 09:36:27,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:27,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:27,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:27,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292112140] [2024-11-19 09:36:27,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292112140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:27,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:27,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:27,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930114159] [2024-11-19 09:36:27,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:27,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:27,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-19 09:36:27,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:27,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:27,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-19 09:36:27,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:28,115 INFO L124 PetriNetUnfolderBase]: 468/874 cut-off events. [2024-11-19 09:36:28,115 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2024-11-19 09:36:28,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 874 events. 468/874 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3408 event pairs, 382 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 2432. Up to 777 conditions per place. [2024-11-19 09:36:28,118 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 66 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-11-19 09:36:28,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 417 flow [2024-11-19 09:36:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:28,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:28,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2024-11-19 09:36:28,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2024-11-19 09:36:28,119 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 234 flow. Second operand 3 states and 182 transitions. [2024-11-19 09:36:28,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 417 flow [2024-11-19 09:36:28,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 405 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:36:28,121 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 266 flow [2024-11-19 09:36:28,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-11-19 09:36:28,121 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -28 predicate places. [2024-11-19 09:36:28,121 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 266 flow [2024-11-19 09:36:28,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:28,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:28,122 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 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-19 09:36:28,131 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 (20)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:28,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:28,322 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash 761685876, now seen corresponding path program 1 times [2024-11-19 09:36:28,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:28,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214123204] [2024-11-19 09:36:28,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:28,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:28,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:28,326 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:28,326 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 (21)] Waiting until timeout for monitored process [2024-11-19 09:36:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:28,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:36:28,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:28,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:28,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:28,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:36:28,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:28,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 09:36:28,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-19 09:36:28,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:28,627 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:28,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:28,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214123204] [2024-11-19 09:36:28,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214123204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:28,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:28,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:36:28,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736085761] [2024-11-19 09:36:28,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:28,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:36:28,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:28,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:36:28,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:36:28,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-19 09:36:28,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:28,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:28,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-19 09:36:28,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:29,068 INFO L124 PetriNetUnfolderBase]: 477/901 cut-off events. [2024-11-19 09:36:29,069 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2024-11-19 09:36:29,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2534 conditions, 901 events. 477/901 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3543 event pairs, 395 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2523. Up to 800 conditions per place. [2024-11-19 09:36:29,072 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 68 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-11-19 09:36:29,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 477 flow [2024-11-19 09:36:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:36:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:36:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-11-19 09:36:29,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2024-11-19 09:36:29,073 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 266 flow. Second operand 3 states and 181 transitions. [2024-11-19 09:36:29,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 477 flow [2024-11-19 09:36:29,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 453 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:29,075 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 314 flow [2024-11-19 09:36:29,075 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-11-19 09:36:29,076 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -26 predicate places. [2024-11-19 09:36:29,076 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 314 flow [2024-11-19 09:36:29,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:29,076 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:29,076 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 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-19 09:36:29,085 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 (21)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:29,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:29,276 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:29,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1611433875, now seen corresponding path program 1 times [2024-11-19 09:36:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906866255] [2024-11-19 09:36:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:36:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:29,280 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:29,281 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 (22)] Waiting until timeout for monitored process [2024-11-19 09:36:29,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:36:29,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 09:36:29,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:29,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 09:36:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:29,624 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:29,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:29,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906866255] [2024-11-19 09:36:29,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906866255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:29,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:29,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:36:29,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018112564] [2024-11-19 09:36:29,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:29,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:36:29,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:29,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:36:29,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:36:29,625 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:29,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:29,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:29,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:29,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:30,216 INFO L124 PetriNetUnfolderBase]: 541/1023 cut-off events. [2024-11-19 09:36:30,216 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2024-11-19 09:36:30,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 1023 events. 541/1023 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4512 event pairs, 48 based on Foata normal form. 16/1027 useless extension candidates. Maximal degree in co-relation 2934. Up to 562 conditions per place. [2024-11-19 09:36:30,219 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 105 selfloop transitions, 22 changer transitions 0/149 dead transitions. [2024-11-19 09:36:30,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 149 transitions, 811 flow [2024-11-19 09:36:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:36:30,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:36:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 541 transitions. [2024-11-19 09:36:30,221 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43629032258064515 [2024-11-19 09:36:30,221 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 314 flow. Second operand 10 states and 541 transitions. [2024-11-19 09:36:30,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 149 transitions, 811 flow [2024-11-19 09:36:30,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 149 transitions, 795 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 09:36:30,224 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 462 flow [2024-11-19 09:36:30,224 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=462, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2024-11-19 09:36:30,225 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -13 predicate places. [2024-11-19 09:36:30,225 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 462 flow [2024-11-19 09:36:30,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:30,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:30,225 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 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-19 09:36:30,233 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 (22)] Forceful destruction successful, exit code 0 [2024-11-19 09:36:30,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:30,426 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -660361977, now seen corresponding path program 2 times [2024-11-19 09:36:30,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:30,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249748224] [2024-11-19 09:36:30,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:36:30,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:30,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:30,428 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:30,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-19 09:36:30,636 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 09:36:30,636 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:36:30,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 09:36:30,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:36:30,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 09:36:30,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:36:30,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:36:30,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:36:30,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249748224] [2024-11-19 09:36:30,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249748224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:36:30,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:36:30,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:36:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974773852] [2024-11-19 09:36:30,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:36:30,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 09:36:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:36:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 09:36:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 09:36:30,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-19 09:36:30,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:30,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:36:30,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-19 09:36:30,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:36:31,577 INFO L124 PetriNetUnfolderBase]: 644/1233 cut-off events. [2024-11-19 09:36:31,578 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2024-11-19 09:36:31,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 1233 events. 644/1233 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5922 event pairs, 35 based on Foata normal form. 16/1215 useless extension candidates. Maximal degree in co-relation 4093. Up to 421 conditions per place. [2024-11-19 09:36:31,583 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 140 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2024-11-19 09:36:31,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 196 transitions, 1261 flow [2024-11-19 09:36:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:36:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:36:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 651 transitions. [2024-11-19 09:36:31,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-11-19 09:36:31,586 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 462 flow. Second operand 12 states and 651 transitions. [2024-11-19 09:36:31,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 196 transitions, 1261 flow [2024-11-19 09:36:31,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 196 transitions, 1230 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-19 09:36:31,591 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 644 flow [2024-11-19 09:36:31,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=644, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-11-19 09:36:31,592 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-19 09:36:31,592 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 644 flow [2024-11-19 09:36:31,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:36:31,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:36:31,592 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 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-19 09:36:31,601 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 (23)] Ended with exit code 0 [2024-11-19 09:36:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:31,793 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-19 09:36:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:36:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash 910036231, now seen corresponding path program 3 times [2024-11-19 09:36:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:36:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758634594] [2024-11-19 09:36:31,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:36:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:36:31,797 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:36:31,798 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 (24)] Waiting until timeout for monitored process [2024-11-19 09:36:32,104 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 09:36:32,104 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:36:32,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:36:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:36:32,303 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:36:32,303 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:36:32,304 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-19 09:36:32,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-19 09:36:32,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-19 09:36:32,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-11-19 09:36:32,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-19 09:36:32,306 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (32 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-11-19 09:36:32,307 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-19 09:36:32,308 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-19 09:36:32,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-19 09:36:32,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-19 09:36:32,309 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-19 09:36:32,321 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 (24)] Ended with exit code 0 [2024-11-19 09:36:32,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:36:32,510 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:36:32,553 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:36:32,553 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:36:32,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:36:32 BasicIcfg [2024-11-19 09:36:32,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:36:32,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:36:32,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:36:32,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:36:32,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:35:58" (3/4) ... [2024-11-19 09:36:32,560 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:36:32,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:36:32,561 INFO L158 Benchmark]: Toolchain (without parser) took 35394.01ms. Allocated memory was 67.1MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 34.4MB in the beginning and 889.2MB in the end (delta: -854.8MB). Peak memory consumption was 441.4MB. Max. memory is 16.1GB. [2024-11-19 09:36:32,561 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 50.3MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:36:32,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 699.81ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 34.0MB in the beginning and 50.3MB in the end (delta: -16.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-19 09:36:32,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.70ms. Allocated memory is still 86.0MB. Free memory was 50.3MB in the beginning and 47.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:36:32,563 INFO L158 Benchmark]: Boogie Preprocessor took 84.62ms. Allocated memory is still 86.0MB. Free memory was 47.4MB in the beginning and 42.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 09:36:32,563 INFO L158 Benchmark]: RCFGBuilder took 974.26ms. Allocated memory is still 86.0MB. Free memory was 42.4MB in the beginning and 47.7MB in the end (delta: -5.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2024-11-19 09:36:32,563 INFO L158 Benchmark]: TraceAbstraction took 33563.92ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 47.1MB in the beginning and 890.2MB in the end (delta: -843.1MB). Peak memory consumption was 436.3MB. Max. memory is 16.1GB. [2024-11-19 09:36:32,563 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.4GB. Free memory was 890.2MB in the beginning and 889.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:36:32,564 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.94ms. Allocated memory is still 50.3MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 699.81ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 34.0MB in the beginning and 50.3MB in the end (delta: -16.3MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.70ms. Allocated memory is still 86.0MB. Free memory was 50.3MB in the beginning and 47.4MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.62ms. Allocated memory is still 86.0MB. Free memory was 47.4MB in the beginning and 42.4MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 974.26ms. Allocated memory is still 86.0MB. Free memory was 42.4MB in the beginning and 47.7MB in the end (delta: -5.3MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * TraceAbstraction took 33563.92ms. Allocated memory was 86.0MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 47.1MB in the beginning and 890.2MB in the end (delta: -843.1MB). Peak memory consumption was 436.3MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.4GB. Free memory was 890.2MB in the beginning and 889.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, d={3:24}, data={3:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3907] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result=0, \result={0:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3941] 0 data->shared.a = 3 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3907] 2 data->shared.a = 1 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3944] 0 data->shared.b = 3 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_5-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_5-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] - 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: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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. - 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: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) 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 with 1 thread instances CFG has 4 procedures, 131 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 33.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2914 SdHoareTripleChecker+Valid, 11.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2431 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 10.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 152 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6172 IncrementalHoareTripleChecker+Invalid, 6427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 106 mSDtfsCounter, 6172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1083occurred in iteration=13, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 325 ConstructedInterpolants, 5 QuantifiedInterpolants, 2185 SizeOfPredicates, 137 NumberOfNonLiveVariables, 3189 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:36:32,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample