./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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-3_2-container_of-global.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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:42,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:42,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:37:42,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:42,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:43,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:43,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:43,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:43,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:43,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:43,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:43,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:43,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:43,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:43,021 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:43,022 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:43,022 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:43,022 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:43,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:43,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:43,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:43,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:43,024 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:43,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:43,025 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:43,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:43,025 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:43,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:43,025 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:43,025 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:43,026 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:37:43,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:37:43,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:43,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:43,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:43,028 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:43,028 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-11-09 10:37:43,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:43,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:43,245 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:43,246 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:43,246 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:43,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-09 10:37:44,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:44,678 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:44,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-09 10:37:44,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dcac5ad/eb91fc4b9eb34b7fae3e0503ef957d43/FLAG6907cb989 [2024-11-09 10:37:44,728 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84dcac5ad/eb91fc4b9eb34b7fae3e0503ef957d43 [2024-11-09 10:37:44,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:44,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:44,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:44,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:44,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:44,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76df16e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44, skipping insertion in model container [2024-11-09 10:37:44,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,832 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:45,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:45,201 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-09 10:37:45,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26422daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:45, skipping insertion in model container [2024-11-09 10:37:45,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:45,202 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:37:45,204 INFO L158 Benchmark]: Toolchain (without parser) took 471.00ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 51.1MB in the beginning and 126.6MB in the end (delta: -75.4MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:45,204 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 125.8MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:37:45,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 468.03ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 50.9MB in the beginning and 126.6MB in the end (delta: -75.6MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-09 10:37:45,207 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.09ms. Allocated memory is still 125.8MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 468.03ms. Allocated memory was 125.8MB in the beginning and 176.2MB in the end (delta: 50.3MB). Free memory was 50.9MB in the beginning and 126.6MB in the end (delta: -75.6MB). Peak memory consumption was 12.2MB. 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-3_2-container_of-global.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 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:46,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:46,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:37:46,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:46,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:46,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:46,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:46,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:46,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:46,851 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:46,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:46,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:46,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:46,854 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:46,854 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:46,855 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:46,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:46,855 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:46,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:46,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:46,855 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:46,856 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:46,856 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:46,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:46,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:46,859 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:37:46,859 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:46,859 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:37:46,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:46,859 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:46,860 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:46,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:46,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:46,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:46,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:46,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:46,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:46,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:46,861 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:37:46,861 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:37:46,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:46,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:46,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:46,862 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:46,863 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 -> 0b03aab73b78beaf1bb7c49b9c847245bb2e0f74d5ca4021b62d8afb0b1e5702 [2024-11-09 10:37:47,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:47,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:47,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:47,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:47,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:47,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-09 10:37:48,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:48,709 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:48,709 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2024-11-09 10:37:48,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5794c66b6/1c6cdbf20cd040c2ba5b2b982d7c7b30/FLAG1698a6c1b [2024-11-09 10:37:48,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5794c66b6/1c6cdbf20cd040c2ba5b2b982d7c7b30 [2024-11-09 10:37:48,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:48,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:48,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:48,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:48,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:48,767 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:48" (1/1) ... [2024-11-09 10:37:48,768 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@636a9e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:48, skipping insertion in model container [2024-11-09 10:37:48,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:48" (1/1) ... [2024-11-09 10:37:48,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:49,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:49,207 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:37:49,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:49,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:49,261 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:37:49,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:49,338 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:37:49,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49 WrapperNode [2024-11-09 10:37:49,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:49,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:49,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:37:49,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:37:49,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,385 INFO L138 Inliner]: procedures = 249, calls = 44, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 143 [2024-11-09 10:37:49,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:49,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:37:49,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:37:49,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:37:49,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,415 INFO L175 MemorySlicer]: Split 17 memory accesses to 3 slices as follows [2, 13, 2]. 76 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 6, 2]. [2024-11-09 10:37:49,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,415 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,429 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:37:49,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:37:49,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:37:49,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:37:49,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:37:49,496 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-09 10:37:49,498 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-09 10:37:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:37:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:37:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:37:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-09 10:37:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-09 10:37:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:37:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:37:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:37:49,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:37:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:37:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:37:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:37:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:37:49,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:37:49,546 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:37:49,816 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:37:49,818 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:37:50,199 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:37:50,200 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:37:50,290 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:37:50,291 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:37:50,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:50 BoogieIcfgContainer [2024-11-09 10:37:50,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:37:50,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:37:50,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:37:50,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:37:50,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:48" (1/3) ... [2024-11-09 10:37:50,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606b45e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:50, skipping insertion in model container [2024-11-09 10:37:50,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49" (2/3) ... [2024-11-09 10:37:50,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@606b45e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:50, skipping insertion in model container [2024-11-09 10:37:50,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:50" (3/3) ... [2024-11-09 10:37:50,299 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-11-09 10:37:50,310 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:37:50,311 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-09 10:37:50,311 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:37:50,365 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:37:50,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 126 transitions, 266 flow [2024-11-09 10:37:50,436 INFO L124 PetriNetUnfolderBase]: 18/159 cut-off events. [2024-11-09 10:37:50,436 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:37:50,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 159 events. 18/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 480 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-09 10:37:50,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 126 transitions, 266 flow [2024-11-09 10:37:50,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 116 places, 124 transitions, 260 flow [2024-11-09 10:37:50,452 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:37:50,458 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;@53eb6e1e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:37:50,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-09 10:37:50,462 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:37:50,464 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-09 10:37:50,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:50,464 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:50,464 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:37:50,465 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:50,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:50,469 INFO L85 PathProgramCache]: Analyzing trace with hash 498015, now seen corresponding path program 1 times [2024-11-09 10:37:50,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:50,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012681229] [2024-11-09 10:37:50,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:50,481 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-09 10:37:50,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:50,483 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-09 10:37:50,499 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-09 10:37:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:50,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:50,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:50,655 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-09 10:37:50,664 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-09 10:37:50,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:50,666 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:50,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012681229] [2024-11-09 10:37:50,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012681229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:50,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135914687] [2024-11-09 10:37:50,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:50,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:50,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:50,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:50,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:50,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 126 [2024-11-09 10:37:50,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 124 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-09 10:37:50,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:50,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 126 [2024-11-09 10:37:50,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:51,637 INFO L124 PetriNetUnfolderBase]: 3071/7677 cut-off events. [2024-11-09 10:37:51,637 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-09 10:37:51,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12595 conditions, 7677 events. 3071/7677 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 74029 event pairs, 407 based on Foata normal form. 588/5627 useless extension candidates. Maximal degree in co-relation 12356. Up to 4146 conditions per place. [2024-11-09 10:37:51,693 INFO L140 encePairwiseOnDemand]: 108/126 looper letters, 78 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-11-09 10:37:51,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 124 transitions, 420 flow [2024-11-09 10:37:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2024-11-09 10:37:51,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-11-09 10:37:51,718 INFO L175 Difference]: Start difference. First operand has 116 places, 124 transitions, 260 flow. Second operand 3 states and 234 transitions. [2024-11-09 10:37:51,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 124 transitions, 420 flow [2024-11-09 10:37:51,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 124 transitions, 412 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:51,727 INFO L231 Difference]: Finished difference. Result has 104 places, 102 transitions, 212 flow [2024-11-09 10:37:51,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=104, PETRI_TRANSITIONS=102} [2024-11-09 10:37:51,736 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -12 predicate places. [2024-11-09 10:37:51,737 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 102 transitions, 212 flow [2024-11-09 10:37:51,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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-09 10:37:51,737 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:51,737 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:37:51,743 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-09 10:37:51,938 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-09 10:37:51,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:51,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 498016, now seen corresponding path program 1 times [2024-11-09 10:37:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:51,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709951244] [2024-11-09 10:37:51,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:51,943 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-09 10:37:51,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:51,945 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-09 10:37:51,946 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-09 10:37:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:52,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:37:52,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:52,041 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-09 10:37:52,048 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-09 10:37:52,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:52,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709951244] [2024-11-09 10:37:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709951244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:52,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:52,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228653554] [2024-11-09 10:37:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:52,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:52,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:52,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2024-11-09 10:37:52,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-09 10:37:52,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:52,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2024-11-09 10:37:52,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:52,800 INFO L124 PetriNetUnfolderBase]: 3071/7673 cut-off events. [2024-11-09 10:37:52,801 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2024-11-09 10:37:52,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12708 conditions, 7673 events. 3071/7673 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 73950 event pairs, 407 based on Foata normal form. 2/5037 useless extension candidates. Maximal degree in co-relation 1475. Up to 4146 conditions per place. [2024-11-09 10:37:52,844 INFO L140 encePairwiseOnDemand]: 120/126 looper letters, 76 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-11-09 10:37:52,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 120 transitions, 404 flow [2024-11-09 10:37:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-11-09 10:37:52,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2024-11-09 10:37:52,847 INFO L175 Difference]: Start difference. First operand has 104 places, 102 transitions, 212 flow. Second operand 3 states and 226 transitions. [2024-11-09 10:37:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 120 transitions, 404 flow [2024-11-09 10:37:52,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 120 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:52,852 INFO L231 Difference]: Finished difference. Result has 100 places, 98 transitions, 204 flow [2024-11-09 10:37:52,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2024-11-09 10:37:52,853 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -16 predicate places. [2024-11-09 10:37:52,853 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 98 transitions, 204 flow [2024-11-09 10:37:52,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 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-09 10:37:52,854 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:52,854 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:37:52,859 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-09 10:37:53,054 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-09 10:37:53,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:53,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:53,055 INFO L85 PathProgramCache]: Analyzing trace with hash 15437293, now seen corresponding path program 1 times [2024-11-09 10:37:53,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:53,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657789755] [2024-11-09 10:37:53,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:53,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:53,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:53,059 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-09 10:37:53,078 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-09 10:37:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:53,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:37:53,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:53,148 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-09 10:37:53,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:53,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:53,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657789755] [2024-11-09 10:37:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657789755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:53,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469270793] [2024-11-09 10:37:53,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:53,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:53,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:53,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:53,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2024-11-09 10:37:53,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-09 10:37:53,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:53,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2024-11-09 10:37:53,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:53,712 INFO L124 PetriNetUnfolderBase]: 3070/5968 cut-off events. [2024-11-09 10:37:53,713 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-11-09 10:37:53,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11003 conditions, 5968 events. 3070/5968 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 44328 event pairs, 2805 based on Foata normal form. 1/4093 useless extension candidates. Maximal degree in co-relation 5422. Up to 4464 conditions per place. [2024-11-09 10:37:53,739 INFO L140 encePairwiseOnDemand]: 123/126 looper letters, 76 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-11-09 10:37:53,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 402 flow [2024-11-09 10:37:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2024-11-09 10:37:53,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6137566137566137 [2024-11-09 10:37:53,742 INFO L175 Difference]: Start difference. First operand has 100 places, 98 transitions, 204 flow. Second operand 3 states and 232 transitions. [2024-11-09 10:37:53,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 402 flow [2024-11-09 10:37:53,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 119 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:53,745 INFO L231 Difference]: Finished difference. Result has 100 places, 97 transitions, 202 flow [2024-11-09 10:37:53,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=100, PETRI_TRANSITIONS=97} [2024-11-09 10:37:53,745 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -16 predicate places. [2024-11-09 10:37:53,746 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 97 transitions, 202 flow [2024-11-09 10:37:53,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-09 10:37:53,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:53,746 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:53,751 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-09 10:37:53,949 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-09 10:37:53,950 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:53,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:53,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1057546939, now seen corresponding path program 1 times [2024-11-09 10:37:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1501877697] [2024-11-09 10:37:53,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:53,952 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-09 10:37:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:53,955 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-09 10:37:53,956 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-09 10:37:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:54,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:37:54,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:54,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:54,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:54,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:54,080 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-09 10:37:54,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:54,155 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-09 10:37:54,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:54,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 45 [2024-11-09 10:37:54,231 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-09 10:37:54,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:54,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:54,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1501877697] [2024-11-09 10:37:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1501877697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:54,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147436997] [2024-11-09 10:37:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:54,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:37:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:54,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:37:54,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:37:54,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 126 [2024-11-09 10:37:54,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 97 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-09 10:37:54,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:54,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 126 [2024-11-09 10:37:54,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:55,021 INFO L124 PetriNetUnfolderBase]: 3598/6893 cut-off events. [2024-11-09 10:37:55,022 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2024-11-09 10:37:55,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12746 conditions, 6893 events. 3598/6893 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 51032 event pairs, 2343 based on Foata normal form. 1/4762 useless extension candidates. Maximal degree in co-relation 11777. Up to 5605 conditions per place. [2024-11-09 10:37:55,045 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 64 selfloop transitions, 6 changer transitions 0/106 dead transitions. [2024-11-09 10:37:55,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 106 transitions, 361 flow [2024-11-09 10:37:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:37:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:37:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2024-11-09 10:37:55,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2024-11-09 10:37:55,049 INFO L175 Difference]: Start difference. First operand has 100 places, 97 transitions, 202 flow. Second operand 4 states and 267 transitions. [2024-11-09 10:37:55,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 106 transitions, 361 flow [2024-11-09 10:37:55,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 106 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:55,056 INFO L231 Difference]: Finished difference. Result has 99 places, 97 transitions, 222 flow [2024-11-09 10:37:55,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=99, PETRI_TRANSITIONS=97} [2024-11-09 10:37:55,057 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -17 predicate places. [2024-11-09 10:37:55,057 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 97 transitions, 222 flow [2024-11-09 10:37:55,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-09 10:37:55,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:55,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:55,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:37:55,258 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-09 10:37:55,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:55,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1758384081, now seen corresponding path program 1 times [2024-11-09 10:37:55,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:55,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012395386] [2024-11-09 10:37:55,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:55,260 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-09 10:37:55,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:55,263 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-09 10:37:55,264 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-09 10:37:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:55,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:37:55,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:55,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:55,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:55,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:55,380 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-09 10:37:55,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:55,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 117 treesize of output 45 [2024-11-09 10:37:55,473 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-09 10:37:55,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:55,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:55,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012395386] [2024-11-09 10:37:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012395386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187629939] [2024-11-09 10:37:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:37:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:37:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:37:55,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 126 [2024-11-09 10:37:55,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 97 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-09 10:37:55,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:55,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 126 [2024-11-09 10:37:55,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:56,195 INFO L124 PetriNetUnfolderBase]: 3598/6890 cut-off events. [2024-11-09 10:37:56,195 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2024-11-09 10:37:56,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13121 conditions, 6890 events. 3598/6890 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 51038 event pairs, 2343 based on Foata normal form. 1/5099 useless extension candidates. Maximal degree in co-relation 7001. Up to 5605 conditions per place. [2024-11-09 10:37:56,217 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 63 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-11-09 10:37:56,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 373 flow [2024-11-09 10:37:56,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:37:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:37:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 266 transitions. [2024-11-09 10:37:56,219 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-11-09 10:37:56,219 INFO L175 Difference]: Start difference. First operand has 99 places, 97 transitions, 222 flow. Second operand 4 states and 266 transitions. [2024-11-09 10:37:56,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 373 flow [2024-11-09 10:37:56,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 103 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:56,221 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 222 flow [2024-11-09 10:37:56,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-11-09 10:37:56,222 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -19 predicate places. [2024-11-09 10:37:56,222 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 222 flow [2024-11-09 10:37:56,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-09 10:37:56,222 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:56,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:56,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:56,423 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-09 10:37:56,423 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:56,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:56,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1629828376, now seen corresponding path program 1 times [2024-11-09 10:37:56,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:56,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489756436] [2024-11-09 10:37:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:56,428 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-09 10:37:56,428 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-09 10:37:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:56,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:37:56,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:56,526 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-09 10:37:56,559 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-09 10:37:56,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:56,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489756436] [2024-11-09 10:37:56,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489756436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:56,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:56,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:56,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134001920] [2024-11-09 10:37:56,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:56,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:56,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:56,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:56,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:56,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 126 [2024-11-09 10:37:56,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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-09 10:37:56,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:56,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 126 [2024-11-09 10:37:56,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:57,526 INFO L124 PetriNetUnfolderBase]: 2554/6244 cut-off events. [2024-11-09 10:37:57,527 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-11-09 10:37:57,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10811 conditions, 6244 events. 2554/6244 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 56248 event pairs, 127 based on Foata normal form. 0/4522 useless extension candidates. Maximal degree in co-relation 5200. Up to 2287 conditions per place. [2024-11-09 10:37:57,553 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 142 selfloop transitions, 15 changer transitions 1/193 dead transitions. [2024-11-09 10:37:57,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 193 transitions, 763 flow [2024-11-09 10:37:57,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:37:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:37:57,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2024-11-09 10:37:57,555 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5257936507936508 [2024-11-09 10:37:57,555 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 222 flow. Second operand 8 states and 530 transitions. [2024-11-09 10:37:57,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 193 transitions, 763 flow [2024-11-09 10:37:57,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 193 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:57,559 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 321 flow [2024-11-09 10:37:57,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=321, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-09 10:37:57,560 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -10 predicate places. [2024-11-09 10:37:57,562 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 321 flow [2024-11-09 10:37:57,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.4) internal successors, (242), 5 states have internal predecessors, (242), 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-09 10:37:57,563 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:57,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:57,568 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-09 10:37:57,763 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-09 10:37:57,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:57,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1629828377, now seen corresponding path program 1 times [2024-11-09 10:37:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:57,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881609519] [2024-11-09 10:37:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:57,765 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-09 10:37:57,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:57,768 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-09 10:37:57,769 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-09 10:37:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:57,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:37:57,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:57,875 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-09 10:37:57,948 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-09 10:37:57,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:57,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:57,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881609519] [2024-11-09 10:37:57,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881609519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:57,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:57,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:57,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235073969] [2024-11-09 10:37:57,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:57,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:57,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:57,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:57,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:58,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2024-11-09 10:37:58,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 321 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-09 10:37:58,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:58,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2024-11-09 10:37:58,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:58,758 INFO L124 PetriNetUnfolderBase]: 1721/4277 cut-off events. [2024-11-09 10:37:58,758 INFO L125 PetriNetUnfolderBase]: For 1999/1999 co-relation queries the response was YES. [2024-11-09 10:37:58,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8613 conditions, 4277 events. 1721/4277 cut-off events. For 1999/1999 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 36188 event pairs, 143 based on Foata normal form. 450/3819 useless extension candidates. Maximal degree in co-relation 7442. Up to 1957 conditions per place. [2024-11-09 10:37:58,769 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 125 selfloop transitions, 12 changer transitions 2/176 dead transitions. [2024-11-09 10:37:58,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 176 transitions, 772 flow [2024-11-09 10:37:58,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:37:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:37:58,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 473 transitions. [2024-11-09 10:37:58,771 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.536281179138322 [2024-11-09 10:37:58,771 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 321 flow. Second operand 7 states and 473 transitions. [2024-11-09 10:37:58,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 176 transitions, 772 flow [2024-11-09 10:37:58,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 176 transitions, 772 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:37:58,776 INFO L231 Difference]: Finished difference. Result has 115 places, 106 transitions, 379 flow [2024-11-09 10:37:58,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=379, PETRI_PLACES=115, PETRI_TRANSITIONS=106} [2024-11-09 10:37:58,777 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -1 predicate places. [2024-11-09 10:37:58,777 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 106 transitions, 379 flow [2024-11-09 10:37:58,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 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-09 10:37:58,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:58,778 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:58,783 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-09 10:37:58,978 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-09 10:37:58,979 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:58,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:58,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1017481812, now seen corresponding path program 1 times [2024-11-09 10:37:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:58,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678236915] [2024-11-09 10:37:58,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:58,980 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-09 10:37:58,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:58,982 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-09 10:37:58,982 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-09 10:37:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:59,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:37:59,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:59,071 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-09 10:37:59,121 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-09 10:37:59,122 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:59,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678236915] [2024-11-09 10:37:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678236915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:59,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066042324] [2024-11-09 10:37:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:59,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:59,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:59,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:59,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:59,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 126 [2024-11-09 10:37:59,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 106 transitions, 379 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-09 10:37:59,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:59,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 126 [2024-11-09 10:37:59,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:59,523 INFO L124 PetriNetUnfolderBase]: 1721/3767 cut-off events. [2024-11-09 10:37:59,523 INFO L125 PetriNetUnfolderBase]: For 3611/3611 co-relation queries the response was YES. [2024-11-09 10:37:59,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8725 conditions, 3767 events. 1721/3767 cut-off events. For 3611/3611 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 27862 event pairs, 959 based on Foata normal form. 146/3323 useless extension candidates. Maximal degree in co-relation 7550. Up to 1747 conditions per place. [2024-11-09 10:37:59,538 INFO L140 encePairwiseOnDemand]: 119/126 looper letters, 91 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2024-11-09 10:37:59,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 128 transitions, 629 flow [2024-11-09 10:37:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2024-11-09 10:37:59,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-11-09 10:37:59,540 INFO L175 Difference]: Start difference. First operand has 115 places, 106 transitions, 379 flow. Second operand 3 states and 225 transitions. [2024-11-09 10:37:59,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 128 transitions, 629 flow [2024-11-09 10:37:59,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 128 transitions, 615 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:59,546 INFO L231 Difference]: Finished difference. Result has 114 places, 107 transitions, 397 flow [2024-11-09 10:37:59,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=397, PETRI_PLACES=114, PETRI_TRANSITIONS=107} [2024-11-09 10:37:59,546 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -2 predicate places. [2024-11-09 10:37:59,547 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 107 transitions, 397 flow [2024-11-09 10:37:59,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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-09 10:37:59,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:59,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:59,556 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-09 10:37:59,751 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-09 10:37:59,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:37:59,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:59,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1017481813, now seen corresponding path program 1 times [2024-11-09 10:37:59,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:59,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160492617] [2024-11-09 10:37:59,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:59,753 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-09 10:37:59,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:59,754 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-09 10:37:59,756 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-09 10:37:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:59,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:59,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:59,849 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-09 10:37:59,874 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-09 10:37:59,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:59,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:59,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160492617] [2024-11-09 10:37:59,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160492617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:59,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:59,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:59,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851716985] [2024-11-09 10:37:59,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:59,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:59,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:59,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:59,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:59,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 126 [2024-11-09 10:37:59,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 107 transitions, 397 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-09 10:37:59,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:59,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 126 [2024-11-09 10:37:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:00,322 INFO L124 PetriNetUnfolderBase]: 1973/3866 cut-off events. [2024-11-09 10:38:00,322 INFO L125 PetriNetUnfolderBase]: For 3841/3841 co-relation queries the response was YES. [2024-11-09 10:38:00,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9595 conditions, 3866 events. 1973/3866 cut-off events. For 3841/3841 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 25879 event pairs, 1313 based on Foata normal form. 0/3337 useless extension candidates. Maximal degree in co-relation 8419. Up to 2473 conditions per place. [2024-11-09 10:38:00,331 INFO L140 encePairwiseOnDemand]: 117/126 looper letters, 80 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2024-11-09 10:38:00,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 595 flow [2024-11-09 10:38:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-11-09 10:38:00,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-09 10:38:00,332 INFO L175 Difference]: Start difference. First operand has 114 places, 107 transitions, 397 flow. Second operand 3 states and 210 transitions. [2024-11-09 10:38:00,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 595 flow [2024-11-09 10:38:00,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 116 transitions, 589 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:38:00,340 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 395 flow [2024-11-09 10:38:00,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=395, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2024-11-09 10:38:00,340 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -6 predicate places. [2024-11-09 10:38:00,340 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 395 flow [2024-11-09 10:38:00,340 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-09 10:38:00,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:00,341 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:00,346 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-09 10:38:00,541 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-09 10:38:00,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:00,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:00,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1398577977, now seen corresponding path program 1 times [2024-11-09 10:38:00,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848085534] [2024-11-09 10:38:00,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:00,543 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-09 10:38:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:00,545 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-09 10:38:00,546 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-09 10:38:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:00,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:38:00,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:00,643 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-09 10:38:00,708 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-09 10:38:00,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:00,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848085534] [2024-11-09 10:38:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848085534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459607502] [2024-11-09 10:38:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:00,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:00,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:00,857 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2024-11-09 10:38:00,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-09 10:38:00,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:00,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2024-11-09 10:38:00,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:01,404 INFO L124 PetriNetUnfolderBase]: 1301/2852 cut-off events. [2024-11-09 10:38:01,404 INFO L125 PetriNetUnfolderBase]: For 2796/2796 co-relation queries the response was YES. [2024-11-09 10:38:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6788 conditions, 2852 events. 1301/2852 cut-off events. For 2796/2796 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 19493 event pairs, 93 based on Foata normal form. 0/2623 useless extension candidates. Maximal degree in co-relation 5906. Up to 1488 conditions per place. [2024-11-09 10:38:01,414 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 116 selfloop transitions, 16 changer transitions 1/165 dead transitions. [2024-11-09 10:38:01,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 165 transitions, 918 flow [2024-11-09 10:38:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:38:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:38:01,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 455 transitions. [2024-11-09 10:38:01,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-11-09 10:38:01,416 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 395 flow. Second operand 7 states and 455 transitions. [2024-11-09 10:38:01,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 165 transitions, 918 flow [2024-11-09 10:38:01,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 165 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:01,424 INFO L231 Difference]: Finished difference. Result has 116 places, 109 transitions, 487 flow [2024-11-09 10:38:01,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=116, PETRI_TRANSITIONS=109} [2024-11-09 10:38:01,425 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 0 predicate places. [2024-11-09 10:38:01,425 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 109 transitions, 487 flow [2024-11-09 10:38:01,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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-09 10:38:01,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:01,426 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:01,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 10:38:01,626 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-09 10:38:01,626 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:01,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:01,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1398577978, now seen corresponding path program 1 times [2024-11-09 10:38:01,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:01,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419656486] [2024-11-09 10:38:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:01,627 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-09 10:38:01,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:01,628 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-09 10:38:01,630 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-09 10:38:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:01,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:38:01,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:01,731 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-09 10:38:01,759 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-09 10:38:01,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:01,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419656486] [2024-11-09 10:38:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419656486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:01,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:01,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495814700] [2024-11-09 10:38:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:01,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:01,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:01,883 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 126 [2024-11-09 10:38:01,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 109 transitions, 487 flow. Second operand has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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-09 10:38:01,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:01,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 126 [2024-11-09 10:38:01,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:02,376 INFO L124 PetriNetUnfolderBase]: 1070/2326 cut-off events. [2024-11-09 10:38:02,376 INFO L125 PetriNetUnfolderBase]: For 2837/2837 co-relation queries the response was YES. [2024-11-09 10:38:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5955 conditions, 2326 events. 1070/2326 cut-off events. For 2837/2837 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15292 event pairs, 153 based on Foata normal form. 65/2328 useless extension candidates. Maximal degree in co-relation 5145. Up to 794 conditions per place. [2024-11-09 10:38:02,383 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 119 selfloop transitions, 21 changer transitions 0/170 dead transitions. [2024-11-09 10:38:02,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 170 transitions, 1003 flow [2024-11-09 10:38:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:38:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:38:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 497 transitions. [2024-11-09 10:38:02,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4930555555555556 [2024-11-09 10:38:02,385 INFO L175 Difference]: Start difference. First operand has 116 places, 109 transitions, 487 flow. Second operand 8 states and 497 transitions. [2024-11-09 10:38:02,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 170 transitions, 1003 flow [2024-11-09 10:38:02,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 170 transitions, 1000 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:38:02,391 INFO L231 Difference]: Finished difference. Result has 127 places, 115 transitions, 612 flow [2024-11-09 10:38:02,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=612, PETRI_PLACES=127, PETRI_TRANSITIONS=115} [2024-11-09 10:38:02,392 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 11 predicate places. [2024-11-09 10:38:02,392 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 115 transitions, 612 flow [2024-11-09 10:38:02,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 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-09 10:38:02,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:02,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:02,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:02,593 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-09 10:38:02,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:02,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash -262746270, now seen corresponding path program 1 times [2024-11-09 10:38:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:02,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735301211] [2024-11-09 10:38:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:02,594 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-09 10:38:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:02,596 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-09 10:38:02,597 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-09 10:38:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:02,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:38:02,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:02,737 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-09 10:38:02,741 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-09 10:38:02,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:02,859 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-09 10:38:02,869 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:02,869 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-09 10:38:02,882 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-09 10:38:02,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:02,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735301211] [2024-11-09 10:38:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735301211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733070616] [2024-11-09 10:38:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:02,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:02,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:02,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:03,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 126 [2024-11-09 10:38:03,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 115 transitions, 612 flow. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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-09 10:38:03,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:03,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 126 [2024-11-09 10:38:03,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:03,773 INFO L124 PetriNetUnfolderBase]: 1229/2618 cut-off events. [2024-11-09 10:38:03,773 INFO L125 PetriNetUnfolderBase]: For 5402/5402 co-relation queries the response was YES. [2024-11-09 10:38:03,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 2618 events. 1229/2618 cut-off events. For 5402/5402 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 17803 event pairs, 320 based on Foata normal form. 27/2634 useless extension candidates. Maximal degree in co-relation 6772. Up to 745 conditions per place. [2024-11-09 10:38:03,783 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 136 selfloop transitions, 21 changer transitions 0/189 dead transitions. [2024-11-09 10:38:03,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 189 transitions, 1225 flow [2024-11-09 10:38:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:38:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:38:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 536 transitions. [2024-11-09 10:38:03,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47266313932980597 [2024-11-09 10:38:03,785 INFO L175 Difference]: Start difference. First operand has 127 places, 115 transitions, 612 flow. Second operand 9 states and 536 transitions. [2024-11-09 10:38:03,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 189 transitions, 1225 flow [2024-11-09 10:38:03,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 1197 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 10:38:03,794 INFO L231 Difference]: Finished difference. Result has 128 places, 113 transitions, 626 flow [2024-11-09 10:38:03,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=626, PETRI_PLACES=128, PETRI_TRANSITIONS=113} [2024-11-09 10:38:03,795 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 12 predicate places. [2024-11-09 10:38:03,795 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 113 transitions, 626 flow [2024-11-09 10:38:03,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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-09 10:38:03,796 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:03,796 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:03,803 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-09 10:38:03,999 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-09 10:38:04,000 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:04,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:04,000 INFO L85 PathProgramCache]: Analyzing trace with hash 390898072, now seen corresponding path program 1 times [2024-11-09 10:38:04,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:04,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071086069] [2024-11-09 10:38:04,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:04,001 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-09 10:38:04,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:04,002 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-09 10:38:04,002 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-09 10:38:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:04,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:38:04,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:04,127 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-09 10:38:04,130 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-09 10:38:04,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:04,243 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-09 10:38:04,250 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:04,251 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-09 10:38:04,260 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-09 10:38:04,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:04,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071086069] [2024-11-09 10:38:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071086069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706725357] [2024-11-09 10:38:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:04,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:04,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 126 [2024-11-09 10:38:04,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 113 transitions, 626 flow. Second operand has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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-09 10:38:04,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:04,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 126 [2024-11-09 10:38:04,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:05,189 INFO L124 PetriNetUnfolderBase]: 1476/3063 cut-off events. [2024-11-09 10:38:05,189 INFO L125 PetriNetUnfolderBase]: For 6622/6622 co-relation queries the response was YES. [2024-11-09 10:38:05,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9501 conditions, 3063 events. 1476/3063 cut-off events. For 6622/6622 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 21683 event pairs, 498 based on Foata normal form. 24/3079 useless extension candidates. Maximal degree in co-relation 6839. Up to 701 conditions per place. [2024-11-09 10:38:05,200 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 133 selfloop transitions, 21 changer transitions 0/186 dead transitions. [2024-11-09 10:38:05,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 186 transitions, 1254 flow [2024-11-09 10:38:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:38:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:38:05,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2024-11-09 10:38:05,202 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4673721340388007 [2024-11-09 10:38:05,202 INFO L175 Difference]: Start difference. First operand has 128 places, 113 transitions, 626 flow. Second operand 9 states and 530 transitions. [2024-11-09 10:38:05,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 186 transitions, 1254 flow [2024-11-09 10:38:05,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 186 transitions, 1202 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:38:05,212 INFO L231 Difference]: Finished difference. Result has 126 places, 111 transitions, 620 flow [2024-11-09 10:38:05,212 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=620, PETRI_PLACES=126, PETRI_TRANSITIONS=111} [2024-11-09 10:38:05,213 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 10 predicate places. [2024-11-09 10:38:05,213 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 111 transitions, 620 flow [2024-11-09 10:38:05,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 46.5) internal successors, (279), 6 states have internal predecessors, (279), 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-09 10:38:05,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:05,213 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] [2024-11-09 10:38:05,219 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-09 10:38:05,413 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-09 10:38:05,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:05,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash 681152799, now seen corresponding path program 1 times [2024-11-09 10:38:05,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:05,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144163312] [2024-11-09 10:38:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:05,415 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-09 10:38:05,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:05,416 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-09 10:38:05,416 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-09 10:38:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:05,553 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:38:05,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:05,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:05,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:05,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:05,560 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-09 10:38:05,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:05,594 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 88 treesize of output 63 [2024-11-09 10:38:05,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:05,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 53 [2024-11-09 10:38:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:05,646 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:05,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:05,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144163312] [2024-11-09 10:38:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144163312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:05,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:05,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951969683] [2024-11-09 10:38:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:05,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:05,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:05,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:05,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 126 [2024-11-09 10:38:05,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 111 transitions, 620 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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-09 10:38:05,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:05,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 126 [2024-11-09 10:38:05,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:07,727 INFO L124 PetriNetUnfolderBase]: 1952/3758 cut-off events. [2024-11-09 10:38:07,727 INFO L125 PetriNetUnfolderBase]: For 8743/8743 co-relation queries the response was YES. [2024-11-09 10:38:07,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12054 conditions, 3758 events. 1952/3758 cut-off events. For 8743/8743 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 26306 event pairs, 1070 based on Foata normal form. 70/3814 useless extension candidates. Maximal degree in co-relation 8993. Up to 2868 conditions per place. [2024-11-09 10:38:07,740 INFO L140 encePairwiseOnDemand]: 116/126 looper letters, 109 selfloop transitions, 23 changer transitions 0/160 dead transitions. [2024-11-09 10:38:07,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 160 transitions, 1143 flow [2024-11-09 10:38:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:38:07,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:38:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 389 transitions. [2024-11-09 10:38:07,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5145502645502645 [2024-11-09 10:38:07,743 INFO L175 Difference]: Start difference. First operand has 126 places, 111 transitions, 620 flow. Second operand 6 states and 389 transitions. [2024-11-09 10:38:07,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 160 transitions, 1143 flow [2024-11-09 10:38:07,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 160 transitions, 1098 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:38:07,758 INFO L231 Difference]: Finished difference. Result has 129 places, 134 transitions, 826 flow [2024-11-09 10:38:07,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=129, PETRI_TRANSITIONS=134} [2024-11-09 10:38:07,758 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 13 predicate places. [2024-11-09 10:38:07,758 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 134 transitions, 826 flow [2024-11-09 10:38:07,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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-09 10:38:07,759 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:07,759 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] [2024-11-09 10:38:07,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:38:07,959 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-09 10:38:07,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:07,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:07,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1603139404, now seen corresponding path program 1 times [2024-11-09 10:38:07,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:07,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758272125] [2024-11-09 10:38:07,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:07,960 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-09 10:38:07,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:07,961 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-09 10:38:07,962 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-09 10:38:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:08,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:38:08,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:08,112 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:08,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:08,113 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:08,114 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-09 10:38:08,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:08,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 49 [2024-11-09 10:38:08,172 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-09 10:38:08,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:08,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758272125] [2024-11-09 10:38:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758272125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:08,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:08,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321059965] [2024-11-09 10:38:08,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:08,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:08,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:08,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 126 [2024-11-09 10:38:08,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 134 transitions, 826 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-09 10:38:08,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:08,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 126 [2024-11-09 10:38:08,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:09,177 INFO L124 PetriNetUnfolderBase]: 2168/4270 cut-off events. [2024-11-09 10:38:09,177 INFO L125 PetriNetUnfolderBase]: For 11957/11963 co-relation queries the response was YES. [2024-11-09 10:38:09,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15003 conditions, 4270 events. 2168/4270 cut-off events. For 11957/11963 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 31120 event pairs, 1110 based on Foata normal form. 108/4364 useless extension candidates. Maximal degree in co-relation 13773. Up to 3008 conditions per place. [2024-11-09 10:38:09,192 INFO L140 encePairwiseOnDemand]: 118/126 looper letters, 114 selfloop transitions, 35 changer transitions 0/178 dead transitions. [2024-11-09 10:38:09,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 178 transitions, 1438 flow [2024-11-09 10:38:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:38:09,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:38:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2024-11-09 10:38:09,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5301587301587302 [2024-11-09 10:38:09,193 INFO L175 Difference]: Start difference. First operand has 129 places, 134 transitions, 826 flow. Second operand 5 states and 334 transitions. [2024-11-09 10:38:09,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 178 transitions, 1438 flow [2024-11-09 10:38:09,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 178 transitions, 1418 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-11-09 10:38:09,215 INFO L231 Difference]: Finished difference. Result has 136 places, 153 transitions, 1136 flow [2024-11-09 10:38:09,216 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1136, PETRI_PLACES=136, PETRI_TRANSITIONS=153} [2024-11-09 10:38:09,216 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 20 predicate places. [2024-11-09 10:38:09,216 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 153 transitions, 1136 flow [2024-11-09 10:38:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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-09 10:38:09,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:09,216 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-09 10:38:09,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:09,417 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-09 10:38:09,417 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:09,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1620575929, now seen corresponding path program 1 times [2024-11-09 10:38:09,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535558033] [2024-11-09 10:38:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:09,418 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-09 10:38:09,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:09,419 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-09 10:38:09,420 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-09 10:38:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:09,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:38:09,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:09,554 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-09 10:38:09,561 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-09 10:38:09,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:09,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:09,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535558033] [2024-11-09 10:38:09,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535558033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:09,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:09,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:09,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034118879] [2024-11-09 10:38:09,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:09,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:09,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:09,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:09,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:09,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 126 [2024-11-09 10:38:09,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 153 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-09 10:38:09,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:09,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 126 [2024-11-09 10:38:09,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:10,113 INFO L124 PetriNetUnfolderBase]: 2100/4163 cut-off events. [2024-11-09 10:38:10,114 INFO L125 PetriNetUnfolderBase]: For 15742/15758 co-relation queries the response was YES. [2024-11-09 10:38:10,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16352 conditions, 4163 events. 2100/4163 cut-off events. For 15742/15758 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 30533 event pairs, 1242 based on Foata normal form. 1/4123 useless extension candidates. Maximal degree in co-relation 15010. Up to 3461 conditions per place. [2024-11-09 10:38:10,131 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 123 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2024-11-09 10:38:10,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 159 transitions, 1444 flow [2024-11-09 10:38:10,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-11-09 10:38:10,132 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-09 10:38:10,133 INFO L175 Difference]: Start difference. First operand has 136 places, 153 transitions, 1136 flow. Second operand 3 states and 210 transitions. [2024-11-09 10:38:10,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 159 transitions, 1444 flow [2024-11-09 10:38:10,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 159 transitions, 1430 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-09 10:38:10,197 INFO L231 Difference]: Finished difference. Result has 136 places, 151 transitions, 1128 flow [2024-11-09 10:38:10,198 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=136, PETRI_TRANSITIONS=151} [2024-11-09 10:38:10,199 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 20 predicate places. [2024-11-09 10:38:10,199 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 151 transitions, 1128 flow [2024-11-09 10:38:10,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-09 10:38:10,199 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:10,199 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-09 10:38:10,206 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-09 10:38:10,399 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-09 10:38:10,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:10,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1620575930, now seen corresponding path program 1 times [2024-11-09 10:38:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:10,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513229424] [2024-11-09 10:38:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:10,401 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-09 10:38:10,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:10,402 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-09 10:38:10,403 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-09 10:38:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:10,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:38:10,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:10,522 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-09 10:38:10,526 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-09 10:38:10,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:10,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:10,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513229424] [2024-11-09 10:38:10,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513229424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:10,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:10,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:10,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174930011] [2024-11-09 10:38:10,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:10,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:10,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:10,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 126 [2024-11-09 10:38:10,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 151 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-09 10:38:10,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:10,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 126 [2024-11-09 10:38:10,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:11,024 INFO L124 PetriNetUnfolderBase]: 2100/4156 cut-off events. [2024-11-09 10:38:11,024 INFO L125 PetriNetUnfolderBase]: For 15517/15533 co-relation queries the response was YES. [2024-11-09 10:38:11,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16311 conditions, 4156 events. 2100/4156 cut-off events. For 15517/15533 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 30426 event pairs, 1242 based on Foata normal form. 1/4116 useless extension candidates. Maximal degree in co-relation 15684. Up to 3461 conditions per place. [2024-11-09 10:38:11,046 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 123 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2024-11-09 10:38:11,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 157 transitions, 1436 flow [2024-11-09 10:38:11,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2024-11-09 10:38:11,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-11-09 10:38:11,048 INFO L175 Difference]: Start difference. First operand has 136 places, 151 transitions, 1128 flow. Second operand 3 states and 210 transitions. [2024-11-09 10:38:11,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 157 transitions, 1436 flow [2024-11-09 10:38:11,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 157 transitions, 1426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:11,078 INFO L231 Difference]: Finished difference. Result has 134 places, 149 transitions, 1124 flow [2024-11-09 10:38:11,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=134, PETRI_TRANSITIONS=149} [2024-11-09 10:38:11,078 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 18 predicate places. [2024-11-09 10:38:11,079 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 149 transitions, 1124 flow [2024-11-09 10:38:11,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-09 10:38:11,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:11,079 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-09 10:38:11,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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:11,279 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-09 10:38:11,280 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1842184571, now seen corresponding path program 1 times [2024-11-09 10:38:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551353943] [2024-11-09 10:38:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:11,281 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-09 10:38:11,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:11,282 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-09 10:38:11,282 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-09 10:38:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:11,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:38:11,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:11,523 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_79| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_79|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_79| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-09 10:38:11,536 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-09 10:38:11,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:11,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551353943] [2024-11-09 10:38:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551353943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:11,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:11,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:11,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534385275] [2024-11-09 10:38:11,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:11,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:11,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-09 10:38:11,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 126 [2024-11-09 10:38:11,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 149 transitions, 1124 flow. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-09 10:38:11,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:11,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 126 [2024-11-09 10:38:11,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:12,367 INFO L124 PetriNetUnfolderBase]: 2220/4294 cut-off events. [2024-11-09 10:38:12,367 INFO L125 PetriNetUnfolderBase]: For 15796/15796 co-relation queries the response was YES. [2024-11-09 10:38:12,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16933 conditions, 4294 events. 2220/4294 cut-off events. For 15796/15796 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 30427 event pairs, 847 based on Foata normal form. 0/4290 useless extension candidates. Maximal degree in co-relation 16296. Up to 1947 conditions per place. [2024-11-09 10:38:12,384 INFO L140 encePairwiseOnDemand]: 104/126 looper letters, 131 selfloop transitions, 36 changer transitions 4/187 dead transitions. [2024-11-09 10:38:12,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 187 transitions, 1711 flow [2024-11-09 10:38:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:38:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:38:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2024-11-09 10:38:12,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-11-09 10:38:12,385 INFO L175 Difference]: Start difference. First operand has 134 places, 149 transitions, 1124 flow. Second operand 5 states and 252 transitions. [2024-11-09 10:38:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 187 transitions, 1711 flow [2024-11-09 10:38:12,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 187 transitions, 1701 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:12,411 INFO L231 Difference]: Finished difference. Result has 139 places, 163 transitions, 1376 flow [2024-11-09 10:38:12,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1376, PETRI_PLACES=139, PETRI_TRANSITIONS=163} [2024-11-09 10:38:12,411 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, 23 predicate places. [2024-11-09 10:38:12,411 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 163 transitions, 1376 flow [2024-11-09 10:38:12,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 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-09 10:38:12,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:12,412 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] [2024-11-09 10:38:12,419 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 (19)] Ended with exit code 0 [2024-11-09 10:38:12,612 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-09 10:38:12,612 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:12,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:12,613 INFO L85 PathProgramCache]: Analyzing trace with hash 79962136, now seen corresponding path program 1 times [2024-11-09 10:38:12,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:12,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037003755] [2024-11-09 10:38:12,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:12,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:12,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:12,614 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-09 10:38:12,615 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-09 10:38:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:12,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:38:12,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:12,761 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-09 10:38:12,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:12,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037003755] [2024-11-09 10:38:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037003755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410790846] [2024-11-09 10:38:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:12,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:12,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:12,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 126 [2024-11-09 10:38:12,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 163 transitions, 1376 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-09 10:38:12,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:12,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 126 [2024-11-09 10:38:12,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:12,961 INFO L124 PetriNetUnfolderBase]: 225/436 cut-off events. [2024-11-09 10:38:12,961 INFO L125 PetriNetUnfolderBase]: For 1737/1737 co-relation queries the response was YES. [2024-11-09 10:38:12,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1912 conditions, 436 events. 225/436 cut-off events. For 1737/1737 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1474 event pairs, 31 based on Foata normal form. 36/471 useless extension candidates. Maximal degree in co-relation 1883. Up to 226 conditions per place. [2024-11-09 10:38:12,963 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 64 selfloop transitions, 9 changer transitions 0/96 dead transitions. [2024-11-09 10:38:12,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 96 transitions, 720 flow [2024-11-09 10:38:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2024-11-09 10:38:12,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5218253968253969 [2024-11-09 10:38:12,964 INFO L175 Difference]: Start difference. First operand has 139 places, 163 transitions, 1376 flow. Second operand 4 states and 263 transitions. [2024-11-09 10:38:12,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 96 transitions, 720 flow [2024-11-09 10:38:12,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 96 transitions, 497 flow, removed 50 selfloop flow, removed 33 redundant places. [2024-11-09 10:38:12,968 INFO L231 Difference]: Finished difference. Result has 89 places, 76 transitions, 287 flow [2024-11-09 10:38:12,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=89, PETRI_TRANSITIONS=76} [2024-11-09 10:38:12,969 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -27 predicate places. [2024-11-09 10:38:12,969 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 76 transitions, 287 flow [2024-11-09 10:38:12,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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-09 10:38:12,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:12,969 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, 1, 1, 1, 1] [2024-11-09 10:38:12,976 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-09 10:38:13,170 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-09 10:38:13,170 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1331630625, now seen corresponding path program 1 times [2024-11-09 10:38:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144569426] [2024-11-09 10:38:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:13,171 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-09 10:38:13,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:13,173 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-09 10:38:13,174 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-09 10:38:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:13,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:38:13,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:13,383 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-09 10:38:13,432 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 10:38:13,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 10:38:13,458 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 16 treesize of output 13 [2024-11-09 10:38:13,460 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-09 10:38:13,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:13,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144569426] [2024-11-09 10:38:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144569426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181301235] [2024-11-09 10:38:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:13,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:13,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:13,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:13,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 126 [2024-11-09 10:38:13,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 76 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-09 10:38:13,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:13,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 126 [2024-11-09 10:38:13,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:13,703 INFO L124 PetriNetUnfolderBase]: 225/435 cut-off events. [2024-11-09 10:38:13,703 INFO L125 PetriNetUnfolderBase]: For 590/590 co-relation queries the response was YES. [2024-11-09 10:38:13,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 435 events. 225/435 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1374 event pairs, 127 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 1322. Up to 294 conditions per place. [2024-11-09 10:38:13,705 INFO L140 encePairwiseOnDemand]: 121/126 looper letters, 56 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2024-11-09 10:38:13,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 443 flow [2024-11-09 10:38:13,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2024-11-09 10:38:13,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43452380952380953 [2024-11-09 10:38:13,706 INFO L175 Difference]: Start difference. First operand has 89 places, 76 transitions, 287 flow. Second operand 4 states and 219 transitions. [2024-11-09 10:38:13,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 443 flow [2024-11-09 10:38:13,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 425 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:13,707 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 281 flow [2024-11-09 10:38:13,707 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=281, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-11-09 10:38:13,708 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -28 predicate places. [2024-11-09 10:38:13,708 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 281 flow [2024-11-09 10:38:13,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-09 10:38:13,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:13,708 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, 1, 1, 1, 1] [2024-11-09 10:38:13,716 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-09 10:38:13,908 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-09 10:38:13,909 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:13,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -652910952, now seen corresponding path program 1 times [2024-11-09 10:38:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:13,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344472504] [2024-11-09 10:38:13,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:13,910 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-09 10:38:13,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:13,911 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-09 10:38:13,911 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-09 10:38:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:14,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:38:14,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:14,140 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-09 10:38:14,143 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-09 10:38:14,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:14,314 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-09 10:38:14,320 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:14,321 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-09 10:38:14,339 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-09 10:38:14,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:14,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344472504] [2024-11-09 10:38:14,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344472504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:14,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:14,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642882125] [2024-11-09 10:38:14,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:14,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:14,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:14,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:14,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 126 [2024-11-09 10:38:14,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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-09 10:38:14,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:14,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 126 [2024-11-09 10:38:14,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:14,672 INFO L124 PetriNetUnfolderBase]: 225/429 cut-off events. [2024-11-09 10:38:14,672 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2024-11-09 10:38:14,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 429 events. 225/429 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1372 event pairs, 87 based on Foata normal form. 1/430 useless extension candidates. Maximal degree in co-relation 1282. Up to 215 conditions per place. [2024-11-09 10:38:14,674 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 51 selfloop transitions, 12 changer transitions 0/77 dead transitions. [2024-11-09 10:38:14,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 77 transitions, 427 flow [2024-11-09 10:38:14,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:38:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:38:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 294 transitions. [2024-11-09 10:38:14,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-11-09 10:38:14,675 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 281 flow. Second operand 7 states and 294 transitions. [2024-11-09 10:38:14,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 77 transitions, 427 flow [2024-11-09 10:38:14,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 77 transitions, 413 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:14,677 INFO L231 Difference]: Finished difference. Result has 85 places, 69 transitions, 279 flow [2024-11-09 10:38:14,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=126, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=85, PETRI_TRANSITIONS=69} [2024-11-09 10:38:14,678 INFO L277 CegarLoopForPetriNet]: 116 programPoint places, -31 predicate places. [2024-11-09 10:38:14,678 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 69 transitions, 279 flow [2024-11-09 10:38:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 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-09 10:38:14,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:14,678 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:14,686 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 (22)] Ended with exit code 0 [2024-11-09 10:38:14,879 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-09 10:38:14,879 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (and 48 more)] === [2024-11-09 10:38:14,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1675284071, now seen corresponding path program 1 times [2024-11-09 10:38:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:14,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325241587] [2024-11-09 10:38:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:14,880 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-09 10:38:14,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:14,882 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-09 10:38:14,882 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-09 10:38:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:15,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:38:15,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:15,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:15,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:15,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:15,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:15,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:15,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-09 10:38:15,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:15,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 85 [2024-11-09 10:38:17,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:17,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 133 treesize of output 69 [2024-11-09 10:38:17,313 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-09 10:38:17,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:17,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:17,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325241587] [2024-11-09 10:38:17,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325241587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:17,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:17,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:38:17,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304800497] [2024-11-09 10:38:17,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:17,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:38:17,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:17,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:38:17,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2024-11-09 10:38:18,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:20,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:22,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:24,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:25,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:27,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:29,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:31,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:33,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:34,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:36,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:38,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:40,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:42,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:44,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:45,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:47,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:49,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:50,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:52,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:54,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:55,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:57,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:59,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:01,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:03,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:03,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 126 [2024-11-09 10:39:03,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 69 transitions, 279 flow. Second operand has 8 states, 8 states have (on average 26.125) internal successors, (209), 8 states have internal predecessors, (209), 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-09 10:39:03,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:39:03,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 126 [2024-11-09 10:39:03,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:39:07,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:11,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:13,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:15,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:17,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:22,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:27,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]