./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-3_1-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_1-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 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:41,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:41,907 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:41,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:41,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:41,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:41,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:41,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:41,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:41,943 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:41,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:41,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:41,945 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:41,945 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:41,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:41,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:41,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:41,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:41,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:41,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:41,949 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:41,953 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:41,954 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:41,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:41,954 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:41,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:41,954 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:41,955 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:41,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:41,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:41,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:41,955 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:41,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:41,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:41,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:41,956 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:41,957 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:37:41,957 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:37:41,958 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:41,959 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:41,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:41,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:41,960 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 -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2024-11-09 10:37:42,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:42,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:42,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:42,239 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:42,239 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:42,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2024-11-09 10:37:43,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:44,047 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:44,048 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2024-11-09 10:37:44,096 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876bb85dc/c3087f83ddfb4892ab4af57cc2b98242/FLAG9f3486b0a [2024-11-09 10:37:44,112 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876bb85dc/c3087f83ddfb4892ab4af57cc2b98242 [2024-11-09 10:37:44,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:44,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:44,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:44,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:44,123 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:44,123 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,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b50fd2a 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,126 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,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:44,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:44,771 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:44,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@64bab9d3 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,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:44,773 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:37:44,775 INFO L158 Benchmark]: Toolchain (without parser) took 658.49ms. Allocated memory is still 157.3MB. Free memory was 86.0MB in the beginning and 124.3MB in the end (delta: -38.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 10:37:44,776 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:37:44,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.04ms. Allocated memory is still 157.3MB. Free memory was 85.8MB in the beginning and 124.3MB in the end (delta: -38.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 10:37:44,778 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.19ms. Allocated memory is still 113.2MB. Free memory is still 74.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.04ms. Allocated memory is still 157.3MB. Free memory was 85.8MB in the beginning and 124.3MB in the end (delta: -38.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3902]: 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_1-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 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:46,833 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:46,911 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,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:46,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:46,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:46,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:46,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:46,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:46,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:46,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:46,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:46,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:46,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:46,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:46,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:46,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:46,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:46,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:46,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:46,960 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:46,961 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:46,961 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:46,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:46,962 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:46,962 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:37:46,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:46,963 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:37:46,963 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:46,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:46,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:46,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:46,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:46,964 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:46,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:46,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:46,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:46,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:46,978 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:37:46,979 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:37:46,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:46,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:46,980 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:46,980 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:46,980 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 -> 75716fdd637a22328d600b3257cf24f40a7920b464397c315485c5ed90fb6ece [2024-11-09 10:37:47,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:47,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:47,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:47,305 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:47,305 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:47,306 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2024-11-09 10:37:48,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:49,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:49,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-3_1-container_of-global.i [2024-11-09 10:37:49,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81f6838e/bd1e02897f2044e493177499a74c27ec/FLAG6d384bf90 [2024-11-09 10:37:49,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81f6838e/bd1e02897f2044e493177499a74c27ec [2024-11-09 10:37:49,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:49,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:49,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:49,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:49,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:49,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30a5d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:49, skipping insertion in model container [2024-11-09 10:37:49,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:49" (1/1) ... [2024-11-09 10:37:49,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:50,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:50,058 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:37:50,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:50,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:50,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:37:50,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:50,268 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:37:50,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:50 WrapperNode [2024-11-09 10:37:50,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:50,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:50,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:37:50,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:37:50,279 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:50" (1/1) ... [2024-11-09 10:37:50,310 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:50" (1/1) ... [2024-11-09 10:37:50,345 INFO L138 Inliner]: procedures = 249, calls = 40, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 143 [2024-11-09 10:37:50,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:50,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:37:50,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:37:50,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:37:50,361 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:50" (1/1) ... [2024-11-09 10:37:50,361 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:50" (1/1) ... [2024-11-09 10:37:50,368 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:50" (1/1) ... [2024-11-09 10:37:50,385 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:50,386 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:50" (1/1) ... [2024-11-09 10:37:50,386 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:50" (1/1) ... [2024-11-09 10:37:50,407 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:50" (1/1) ... [2024-11-09 10:37:50,410 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:50" (1/1) ... [2024-11-09 10:37:50,423 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:50" (1/1) ... [2024-11-09 10:37:50,426 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:50" (1/1) ... [2024-11-09 10:37:50,432 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:37:50,433 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:37:50,433 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:37:50,433 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:37:50,434 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:50" (1/1) ... [2024-11-09 10:37:50,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:50,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:37:50,486 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:50,490 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:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:37:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:37:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:37:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-09 10:37:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-09 10:37:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:37:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:37:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:37:50,543 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:37:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:37:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:37:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:37:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:37:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:37:50,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:37:50,547 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:50,854 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:37:50,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:37:51,404 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:37:51,404 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:37:51,523 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:37:51,523 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:37:51,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:51 BoogieIcfgContainer [2024-11-09 10:37:51,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:37:51,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:37:51,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:37:51,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:37:51,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:49" (1/3) ... [2024-11-09 10:37:51,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:51, skipping insertion in model container [2024-11-09 10:37:51,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:50" (2/3) ... [2024-11-09 10:37:51,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153ba7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:51, skipping insertion in model container [2024-11-09 10:37:51,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:51" (3/3) ... [2024-11-09 10:37:51,531 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_1-container_of-global.i [2024-11-09 10:37:51,543 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:37:51,543 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-11-09 10:37:51,543 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:37:51,620 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:37:51,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 132 transitions, 278 flow [2024-11-09 10:37:51,737 INFO L124 PetriNetUnfolderBase]: 18/165 cut-off events. [2024-11-09 10:37:51,737 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:37:51,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 18/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 528 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 86. Up to 4 conditions per place. [2024-11-09 10:37:51,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 132 transitions, 278 flow [2024-11-09 10:37:51,748 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 130 transitions, 272 flow [2024-11-09 10:37:51,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:37:51,764 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;@5e1fad63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:37:51,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-09 10:37:51,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:37:51,768 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-09 10:37:51,768 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:51,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:51,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:37:51,770 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:51,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:51,778 INFO L85 PathProgramCache]: Analyzing trace with hash 495006, now seen corresponding path program 1 times [2024-11-09 10:37:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:51,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090547117] [2024-11-09 10:37:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:51,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:51,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:51,798 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:51,799 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:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:51,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:51,961 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:52,025 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:52,038 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,038 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:52,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:52,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090547117] [2024-11-09 10:37:52,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090547117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:52,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:52,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972485612] [2024-11-09 10:37:52,042 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,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:52,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:52,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:52,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-09 10:37:52,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 130 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:52,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-09 10:37:52,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:52,817 INFO L124 PetriNetUnfolderBase]: 707/2019 cut-off events. [2024-11-09 10:37:52,818 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-09 10:37:52,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3235 conditions, 2019 events. 707/2019 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15812 event pairs, 95 based on Foata normal form. 156/1873 useless extension candidates. Maximal degree in co-relation 3062. Up to 1002 conditions per place. [2024-11-09 10:37:52,838 INFO L140 encePairwiseOnDemand]: 114/132 looper letters, 54 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-11-09 10:37:52,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 118 transitions, 360 flow [2024-11-09 10:37:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-11-09 10:37:52,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 10:37:52,882 INFO L175 Difference]: Start difference. First operand has 122 places, 130 transitions, 272 flow. Second operand 3 states and 264 transitions. [2024-11-09 10:37:52,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 118 transitions, 360 flow [2024-11-09 10:37:52,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 352 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:52,894 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-09 10:37:52,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-11-09 10:37:52,905 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2024-11-09 10:37:52,908 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-09 10:37:52,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:52,909 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:37:52,920 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:53,110 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:53,110 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:53,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:53,111 INFO L85 PathProgramCache]: Analyzing trace with hash 495007, now seen corresponding path program 1 times [2024-11-09 10:37:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:53,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088995093] [2024-11-09 10:37:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:53,113 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,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:53,116 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:53,117 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:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:53,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:37:53,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:53,234 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:53,243 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,243 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:53,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:53,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088995093] [2024-11-09 10:37:53,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088995093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:53,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843599634] [2024-11-09 10:37:53,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:53,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:53,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:53,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:53,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:53,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 132 [2024-11-09 10:37:53,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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:53,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:53,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 132 [2024-11-09 10:37:53,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:53,918 INFO L124 PetriNetUnfolderBase]: 707/2015 cut-off events. [2024-11-09 10:37:53,918 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:37:53,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 2015 events. 707/2015 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 15782 event pairs, 95 based on Foata normal form. 2/1715 useless extension candidates. Maximal degree in co-relation 479. Up to 1002 conditions per place. [2024-11-09 10:37:53,932 INFO L140 encePairwiseOnDemand]: 126/132 looper letters, 52 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-09 10:37:53,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 344 flow [2024-11-09 10:37:53,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2024-11-09 10:37:53,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6464646464646465 [2024-11-09 10:37:53,935 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 256 transitions. [2024-11-09 10:37:53,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 344 flow [2024-11-09 10:37:53,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 114 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:53,939 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 216 flow [2024-11-09 10:37:53,939 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2024-11-09 10:37:53,940 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:37:53,940 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 216 flow [2024-11-09 10:37:53,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 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:53,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:53,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:37:53,947 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:54,145 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:54,146 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:54,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash 15345152, now seen corresponding path program 1 times [2024-11-09 10:37:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040242251] [2024-11-09 10:37:54,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:54,148 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:54,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:54,151 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:54,153 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:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:54,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:37:54,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:54,254 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,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:54,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:54,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040242251] [2024-11-09 10:37:54,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040242251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:54,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:54,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215934112] [2024-11-09 10:37:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:54,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:54,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:54,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:54,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:54,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 132 [2024-11-09 10:37:54,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 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:37:54,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:54,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 132 [2024-11-09 10:37:54,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:54,599 INFO L124 PetriNetUnfolderBase]: 706/1746 cut-off events. [2024-11-09 10:37:54,600 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 10:37:54,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 1746 events. 706/1746 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 12301 event pairs, 645 based on Foata normal form. 1/1476 useless extension candidates. Maximal degree in co-relation 883. Up to 1092 conditions per place. [2024-11-09 10:37:54,613 INFO L140 encePairwiseOnDemand]: 129/132 looper letters, 52 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2024-11-09 10:37:54,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 113 transitions, 342 flow [2024-11-09 10:37:54,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:54,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:54,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-09 10:37:54,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6616161616161617 [2024-11-09 10:37:54,620 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 216 flow. Second operand 3 states and 262 transitions. [2024-11-09 10:37:54,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 113 transitions, 342 flow [2024-11-09 10:37:54,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 113 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:54,625 INFO L231 Difference]: Finished difference. Result has 106 places, 103 transitions, 214 flow [2024-11-09 10:37:54,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=106, PETRI_TRANSITIONS=103} [2024-11-09 10:37:54,626 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:37:54,626 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 103 transitions, 214 flow [2024-11-09 10:37:54,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 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:37:54,627 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:54,627 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:54,633 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:54,832 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:54,833 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:54,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1320838570, now seen corresponding path program 1 times [2024-11-09 10:37:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821804768] [2024-11-09 10:37:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:54,835 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:54,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:54,836 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:54,837 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:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:55,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:37:55,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:55,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:55,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:55,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:55,025 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,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:55,091 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:55,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:55,147 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,170 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,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:55,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:55,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821804768] [2024-11-09 10:37:55,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821804768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:55,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:55,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019607076] [2024-11-09 10:37:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:55,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:37:55,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:37:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:37:55,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-09 10:37:55,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 103 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:55,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-09 10:37:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:56,091 INFO L124 PetriNetUnfolderBase]: 1153/2725 cut-off events. [2024-11-09 10:37:56,092 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-09 10:37:56,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4683 conditions, 2725 events. 1153/2725 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 20094 event pairs, 684 based on Foata normal form. 1/2376 useless extension candidates. Maximal degree in co-relation 4359. Up to 1845 conditions per place. [2024-11-09 10:37:56,107 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 52 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2024-11-09 10:37:56,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 345 flow [2024-11-09 10:37:56,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:37:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:37:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2024-11-09 10:37:56,110 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-11-09 10:37:56,111 INFO L175 Difference]: Start difference. First operand has 106 places, 103 transitions, 214 flow. Second operand 4 states and 319 transitions. [2024-11-09 10:37:56,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 345 flow [2024-11-09 10:37:56,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 110 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:56,117 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 234 flow [2024-11-09 10:37:56,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2024-11-09 10:37:56,119 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -17 predicate places. [2024-11-09 10:37:56,120 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 234 flow [2024-11-09 10:37:56,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:56,120 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:56,130 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:56,321 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:56,321 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:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1433935613, now seen corresponding path program 1 times [2024-11-09 10:37:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892683905] [2024-11-09 10:37:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:56,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:56,327 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:56,331 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:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:56,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:37:56,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:56,514 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:56,515 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:56,516 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:56,520 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:56,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:56,672 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:56,686 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,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:56,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892683905] [2024-11-09 10:37:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892683905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062080745] [2024-11-09 10:37:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:56,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:37:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:37:56,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:37:56,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-09 10:37:56,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:56,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-09 10:37:56,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:57,503 INFO L124 PetriNetUnfolderBase]: 1153/2722 cut-off events. [2024-11-09 10:37:57,504 INFO L125 PetriNetUnfolderBase]: For 217/223 co-relation queries the response was YES. [2024-11-09 10:37:57,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4907 conditions, 2722 events. 1153/2722 cut-off events. For 217/223 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 20125 event pairs, 684 based on Foata normal form. 7/2379 useless extension candidates. Maximal degree in co-relation 2009. Up to 1845 conditions per place. [2024-11-09 10:37:57,520 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 51 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2024-11-09 10:37:57,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 107 transitions, 357 flow [2024-11-09 10:37:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:37:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:37:57,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 318 transitions. [2024-11-09 10:37:57,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-11-09 10:37:57,522 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 234 flow. Second operand 4 states and 318 transitions. [2024-11-09 10:37:57,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 107 transitions, 357 flow [2024-11-09 10:37:57,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 107 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:57,526 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 234 flow [2024-11-09 10:37:57,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2024-11-09 10:37:57,527 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -19 predicate places. [2024-11-09 10:37:57,527 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 234 flow [2024-11-09 10:37:57,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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,527 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:57,528 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:57,538 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:57,728 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:57,729 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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:57,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1081930850, now seen corresponding path program 1 times [2024-11-09 10:37:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833587681] [2024-11-09 10:37:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:57,730 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,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:57,734 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:57,735 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:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:57,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:37:57,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:57,863 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:57,898 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,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:57,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:57,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833587681] [2024-11-09 10:37:57,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833587681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:57,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:57,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:57,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024062838] [2024-11-09 10:37:57,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:57,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:57,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:57,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:57,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:58,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 132 [2024-11-09 10:37:58,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 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:37:58,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:58,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 132 [2024-11-09 10:37:58,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:58,361 INFO L124 PetriNetUnfolderBase]: 954/2206 cut-off events. [2024-11-09 10:37:58,361 INFO L125 PetriNetUnfolderBase]: For 67/70 co-relation queries the response was YES. [2024-11-09 10:37:58,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3923 conditions, 2206 events. 954/2206 cut-off events. For 67/70 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15263 event pairs, 736 based on Foata normal form. 0/2028 useless extension candidates. Maximal degree in co-relation 1642. Up to 1362 conditions per place. [2024-11-09 10:37:58,378 INFO L140 encePairwiseOnDemand]: 123/132 looper letters, 52 selfloop transitions, 4 changer transitions 0/105 dead transitions. [2024-11-09 10:37:58,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 356 flow [2024-11-09 10:37:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:58,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:58,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2024-11-09 10:37:58,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2024-11-09 10:37:58,380 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 234 flow. Second operand 3 states and 246 transitions. [2024-11-09 10:37:58,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 356 flow [2024-11-09 10:37:58,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 105 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:58,385 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 226 flow [2024-11-09 10:37:58,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2024-11-09 10:37:58,386 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-09 10:37:58,387 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 226 flow [2024-11-09 10:37:58,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 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:37:58,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:58,387 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,393 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:58,588 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:58,588 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:58,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1081930849, now seen corresponding path program 1 times [2024-11-09 10:37:58,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:58,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061429006] [2024-11-09 10:37:58,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:58,590 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,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:58,593 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:58,594 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:58,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:58,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:37:58,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:58,732 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:58,811 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:58,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:58,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:58,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061429006] [2024-11-09 10:37:58,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061429006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:58,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:58,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:58,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711355083] [2024-11-09 10:37:58,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:58,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:58,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:58,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:58,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:58,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-09 10:37:58,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:58,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-09 10:37:58,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:59,325 INFO L124 PetriNetUnfolderBase]: 816/1953 cut-off events. [2024-11-09 10:37:59,325 INFO L125 PetriNetUnfolderBase]: For 108/111 co-relation queries the response was YES. [2024-11-09 10:37:59,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3485 conditions, 1953 events. 816/1953 cut-off events. For 108/111 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 13390 event pairs, 531 based on Foata normal form. 88/1857 useless extension candidates. Maximal degree in co-relation 2834. Up to 992 conditions per place. [2024-11-09 10:37:59,337 INFO L140 encePairwiseOnDemand]: 125/132 looper letters, 63 selfloop transitions, 3 changer transitions 0/112 dead transitions. [2024-11-09 10:37:59,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 112 transitions, 394 flow [2024-11-09 10:37:59,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2024-11-09 10:37:59,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2024-11-09 10:37:59,339 INFO L175 Difference]: Start difference. First operand has 98 places, 95 transitions, 226 flow. Second operand 3 states and 261 transitions. [2024-11-09 10:37:59,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 112 transitions, 394 flow [2024-11-09 10:37:59,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 112 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:59,342 INFO L231 Difference]: Finished difference. Result has 99 places, 96 transitions, 239 flow [2024-11-09 10:37:59,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=239, PETRI_PLACES=99, PETRI_TRANSITIONS=96} [2024-11-09 10:37:59,343 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-09 10:37:59,344 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 96 transitions, 239 flow [2024-11-09 10:37:59,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:59,344 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:37:59,351 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:59,545 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:59,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:59,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash 899898882, now seen corresponding path program 1 times [2024-11-09 10:37:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:59,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709832544] [2024-11-09 10:37:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:59,549 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,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:59,553 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:59,554 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,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:59,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:37:59,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:59,710 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,814 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,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:59,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709832544] [2024-11-09 10:37:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709832544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:59,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829964486] [2024-11-09 10:37:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:59,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:59,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:59,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:59,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:00,267 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 132 [2024-11-09 10:38:00,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 96 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 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,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:00,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 132 [2024-11-09 10:38:00,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:00,777 INFO L124 PetriNetUnfolderBase]: 840/2065 cut-off events. [2024-11-09 10:38:00,777 INFO L125 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2024-11-09 10:38:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3791 conditions, 2065 events. 840/2065 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14417 event pairs, 129 based on Foata normal form. 145/2132 useless extension candidates. Maximal degree in co-relation 2615. Up to 948 conditions per place. [2024-11-09 10:38:00,786 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 88 selfloop transitions, 11 changer transitions 2/150 dead transitions. [2024-11-09 10:38:00,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 150 transitions, 570 flow [2024-11-09 10:38:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:38:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:38:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 545 transitions. [2024-11-09 10:38:00,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5898268398268398 [2024-11-09 10:38:00,791 INFO L175 Difference]: Start difference. First operand has 99 places, 96 transitions, 239 flow. Second operand 7 states and 545 transitions. [2024-11-09 10:38:00,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 150 transitions, 570 flow [2024-11-09 10:38:00,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 150 transitions, 563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:38:00,800 INFO L231 Difference]: Finished difference. Result has 106 places, 102 transitions, 301 flow [2024-11-09 10:38:00,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=106, PETRI_TRANSITIONS=102} [2024-11-09 10:38:00,800 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:38:00,801 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 102 transitions, 301 flow [2024-11-09 10:38:00,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.2) internal successors, (326), 5 states have internal predecessors, (326), 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,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:00,801 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,807 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:01,001 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:38:01,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:01,003 INFO L85 PathProgramCache]: Analyzing trace with hash 899898881, now seen corresponding path program 1 times [2024-11-09 10:38:01,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:01,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441631969] [2024-11-09 10:38:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:01,003 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,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:01,005 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:38:01,007 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:38:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:01,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:38:01,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:01,120 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,158 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,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:01,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:01,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441631969] [2024-11-09 10:38:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441631969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831155803] [2024-11-09 10:38:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:01,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:01,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:01,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:01,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:01,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 132 [2024-11-09 10:38:01,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 102 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 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,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:01,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 132 [2024-11-09 10:38:01,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:01,908 INFO L124 PetriNetUnfolderBase]: 1177/2657 cut-off events. [2024-11-09 10:38:01,908 INFO L125 PetriNetUnfolderBase]: For 719/722 co-relation queries the response was YES. [2024-11-09 10:38:01,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 2657 events. 1177/2657 cut-off events. For 719/722 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 18691 event pairs, 139 based on Foata normal form. 64/2602 useless extension candidates. Maximal degree in co-relation 3344. Up to 1078 conditions per place. [2024-11-09 10:38:01,925 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 102 selfloop transitions, 16 changer transitions 0/162 dead transitions. [2024-11-09 10:38:01,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 162 transitions, 669 flow [2024-11-09 10:38:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:38:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:38:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 593 transitions. [2024-11-09 10:38:01,928 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5615530303030303 [2024-11-09 10:38:01,928 INFO L175 Difference]: Start difference. First operand has 106 places, 102 transitions, 301 flow. Second operand 8 states and 593 transitions. [2024-11-09 10:38:01,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 162 transitions, 669 flow [2024-11-09 10:38:01,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 162 transitions, 669 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:38:01,937 INFO L231 Difference]: Finished difference. Result has 118 places, 108 transitions, 405 flow [2024-11-09 10:38:01,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=405, PETRI_PLACES=118, PETRI_TRANSITIONS=108} [2024-11-09 10:38:01,938 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -4 predicate places. [2024-11-09 10:38:01,940 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 108 transitions, 405 flow [2024-11-09 10:38:01,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 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,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:01,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:01,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 10:38:02,141 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:02,142 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:02,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:02,142 INFO L85 PathProgramCache]: Analyzing trace with hash -60742247, now seen corresponding path program 1 times [2024-11-09 10:38:02,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:02,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825646531] [2024-11-09 10:38:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:02,144 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,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:02,148 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:02,150 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:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:02,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:38:02,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:02,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:38:02,392 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,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:02,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:02,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825646531] [2024-11-09 10:38:02,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825646531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:02,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:02,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:02,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409659793] [2024-11-09 10:38:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:02,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:02,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:02,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:02,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 132 [2024-11-09 10:38:02,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 108 transitions, 405 flow. Second operand has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 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,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:02,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 132 [2024-11-09 10:38:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:03,344 INFO L124 PetriNetUnfolderBase]: 894/2272 cut-off events. [2024-11-09 10:38:03,344 INFO L125 PetriNetUnfolderBase]: For 1955/2044 co-relation queries the response was YES. [2024-11-09 10:38:03,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4889 conditions, 2272 events. 894/2272 cut-off events. For 1955/2044 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 16555 event pairs, 125 based on Foata normal form. 173/2387 useless extension candidates. Maximal degree in co-relation 4487. Up to 1036 conditions per place. [2024-11-09 10:38:03,354 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 92 selfloop transitions, 16 changer transitions 1/160 dead transitions. [2024-11-09 10:38:03,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 160 transitions, 807 flow [2024-11-09 10:38:03,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:38:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:38:03,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 542 transitions. [2024-11-09 10:38:03,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5865800865800865 [2024-11-09 10:38:03,357 INFO L175 Difference]: Start difference. First operand has 118 places, 108 transitions, 405 flow. Second operand 7 states and 542 transitions. [2024-11-09 10:38:03,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 160 transitions, 807 flow [2024-11-09 10:38:03,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 160 transitions, 792 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:03,364 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 502 flow [2024-11-09 10:38:03,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=502, PETRI_PLACES=123, PETRI_TRANSITIONS=115} [2024-11-09 10:38:03,365 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2024-11-09 10:38:03,366 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 502 flow [2024-11-09 10:38:03,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 65.6) internal successors, (328), 5 states have internal predecessors, (328), 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,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:03,367 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:03,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:03,567 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:03,568 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:03,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash -60742248, now seen corresponding path program 1 times [2024-11-09 10:38:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:03,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1500817798] [2024-11-09 10:38:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:03,569 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:03,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:03,571 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:03,571 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:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:03,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:38:03,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:03,689 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:03,728 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:03,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:03,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:03,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1500817798] [2024-11-09 10:38:03,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1500817798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:03,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:03,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:03,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378378643] [2024-11-09 10:38:03,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:03,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:03,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:03,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 132 [2024-11-09 10:38:03,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 502 flow. Second operand has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:03,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 132 [2024-11-09 10:38:03,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:04,573 INFO L124 PetriNetUnfolderBase]: 1336/2921 cut-off events. [2024-11-09 10:38:04,574 INFO L125 PetriNetUnfolderBase]: For 3255/3412 co-relation queries the response was YES. [2024-11-09 10:38:04,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 2921 events. 1336/2921 cut-off events. For 3255/3412 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 20367 event pairs, 350 based on Foata normal form. 99/2953 useless extension candidates. Maximal degree in co-relation 6110. Up to 1093 conditions per place. [2024-11-09 10:38:04,590 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 108 selfloop transitions, 21 changer transitions 0/175 dead transitions. [2024-11-09 10:38:04,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 175 transitions, 936 flow [2024-11-09 10:38:04,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:38:04,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:38:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 593 transitions. [2024-11-09 10:38:04,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5615530303030303 [2024-11-09 10:38:04,596 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 502 flow. Second operand 8 states and 593 transitions. [2024-11-09 10:38:04,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 175 transitions, 936 flow [2024-11-09 10:38:04,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 175 transitions, 933 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:38:04,607 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 628 flow [2024-11-09 10:38:04,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=628, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2024-11-09 10:38:04,610 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 12 predicate places. [2024-11-09 10:38:04,610 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 628 flow [2024-11-09 10:38:04,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 62.0) internal successors, (310), 5 states have internal predecessors, (310), 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,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:04,611 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:04,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 10:38:04,811 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:04,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:04,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1770422097, now seen corresponding path program 1 times [2024-11-09 10:38:04,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:04,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333254788] [2024-11-09 10:38:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:04,814 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,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:04,817 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:04,820 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:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:05,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:38:05,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:05,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:05,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:05,011 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:05,013 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,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:05,066 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,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:05,132 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,145 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,145 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:05,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:05,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333254788] [2024-11-09 10:38:05,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333254788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:05,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:05,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:05,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530328469] [2024-11-09 10:38:05,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:05,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:05,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:38:05,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 132 [2024-11-09 10:38:05,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 628 flow. Second operand has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:05,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 132 [2024-11-09 10:38:05,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:06,719 INFO L124 PetriNetUnfolderBase]: 1837/3732 cut-off events. [2024-11-09 10:38:06,719 INFO L125 PetriNetUnfolderBase]: For 7065/7357 co-relation queries the response was YES. [2024-11-09 10:38:06,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 3732 events. 1837/3732 cut-off events. For 7065/7357 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 26444 event pairs, 747 based on Foata normal form. 126/3815 useless extension candidates. Maximal degree in co-relation 9249. Up to 2298 conditions per place. [2024-11-09 10:38:06,740 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 109 selfloop transitions, 23 changer transitions 0/178 dead transitions. [2024-11-09 10:38:06,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 178 transitions, 1140 flow [2024-11-09 10:38:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:38:06,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:38:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2024-11-09 10:38:06,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-09 10:38:06,743 INFO L175 Difference]: Start difference. First operand has 134 places, 121 transitions, 628 flow. Second operand 6 states and 489 transitions. [2024-11-09 10:38:06,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 178 transitions, 1140 flow [2024-11-09 10:38:06,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 178 transitions, 1127 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:06,757 INFO L231 Difference]: Finished difference. Result has 140 places, 144 transitions, 847 flow [2024-11-09 10:38:06,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=847, PETRI_PLACES=140, PETRI_TRANSITIONS=144} [2024-11-09 10:38:06,758 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 18 predicate places. [2024-11-09 10:38:06,758 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 144 transitions, 847 flow [2024-11-09 10:38:06,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 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:06,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:06,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] [2024-11-09 10:38:06,769 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:06,959 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:06,959 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:06,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:06,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2090777992, now seen corresponding path program 1 times [2024-11-09 10:38:06,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:06,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441513442] [2024-11-09 10:38:06,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:06,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:06,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:06,962 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:06,963 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:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:07,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:38:07,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:07,138 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:07,144 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:07,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:07,331 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:07,345 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:07,346 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:07,361 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:07,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:07,362 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:07,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441513442] [2024-11-09 10:38:07,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1441513442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:07,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:07,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:07,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592553660] [2024-11-09 10:38:07,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:07,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:07,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:07,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:07,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:07,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 132 [2024-11-09 10:38:07,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 144 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 56.666666666666664) internal successors, (340), 6 states have internal predecessors, (340), 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,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:07,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 132 [2024-11-09 10:38:07,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:08,664 INFO L124 PetriNetUnfolderBase]: 2107/4453 cut-off events. [2024-11-09 10:38:08,664 INFO L125 PetriNetUnfolderBase]: For 9564/9842 co-relation queries the response was YES. [2024-11-09 10:38:08,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13341 conditions, 4453 events. 2107/4453 cut-off events. For 9564/9842 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 33919 event pairs, 430 based on Foata normal form. 71/4433 useless extension candidates. Maximal degree in co-relation 12231. Up to 1805 conditions per place. [2024-11-09 10:38:08,691 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 146 selfloop transitions, 24 changer transitions 0/220 dead transitions. [2024-11-09 10:38:08,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 220 transitions, 1476 flow [2024-11-09 10:38:08,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:38:08,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:38:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 618 transitions. [2024-11-09 10:38:08,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5202020202020202 [2024-11-09 10:38:08,694 INFO L175 Difference]: Start difference. First operand has 140 places, 144 transitions, 847 flow. Second operand 9 states and 618 transitions. [2024-11-09 10:38:08,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 220 transitions, 1476 flow [2024-11-09 10:38:08,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 220 transitions, 1447 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:08,716 INFO L231 Difference]: Finished difference. Result has 144 places, 142 transitions, 866 flow [2024-11-09 10:38:08,716 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=866, PETRI_PLACES=144, PETRI_TRANSITIONS=142} [2024-11-09 10:38:08,717 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 22 predicate places. [2024-11-09 10:38:08,717 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 142 transitions, 866 flow [2024-11-09 10:38:08,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.666666666666664) internal successors, (340), 6 states have internal predecessors, (340), 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,718 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:08,718 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:08,726 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:08,918 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:08,919 INFO L396 AbstractCegarLoop]: === Iteration 14 === 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:08,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:08,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1414718420, now seen corresponding path program 1 times [2024-11-09 10:38:08,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:08,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144671734] [2024-11-09 10:38:08,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:08,920 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:08,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:08,924 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:08,926 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:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:09,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:38:09,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:09,102 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,106 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:09,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:09,261 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:09,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:09,269 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:09,282 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,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:09,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:09,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144671734] [2024-11-09 10:38:09,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144671734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:09,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:09,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:09,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255787687] [2024-11-09 10:38:09,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:09,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:09,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:09,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:09,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 132 [2024-11-09 10:38:09,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 142 transitions, 866 flow. Second operand has 6 states, 6 states have (on average 56.666666666666664) internal successors, (340), 6 states have internal predecessors, (340), 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,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:09,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 132 [2024-11-09 10:38:09,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:10,649 INFO L124 PetriNetUnfolderBase]: 2387/5011 cut-off events. [2024-11-09 10:38:10,649 INFO L125 PetriNetUnfolderBase]: For 12012/12355 co-relation queries the response was YES. [2024-11-09 10:38:10,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15014 conditions, 5011 events. 2387/5011 cut-off events. For 12012/12355 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 39196 event pairs, 748 based on Foata normal form. 90/5027 useless extension candidates. Maximal degree in co-relation 13930. Up to 1812 conditions per place. [2024-11-09 10:38:10,676 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 146 selfloop transitions, 24 changer transitions 0/218 dead transitions. [2024-11-09 10:38:10,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 218 transitions, 1503 flow [2024-11-09 10:38:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:38:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:38:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 618 transitions. [2024-11-09 10:38:10,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5202020202020202 [2024-11-09 10:38:10,678 INFO L175 Difference]: Start difference. First operand has 144 places, 142 transitions, 866 flow. Second operand 9 states and 618 transitions. [2024-11-09 10:38:10,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 218 transitions, 1503 flow [2024-11-09 10:38:10,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 218 transitions, 1447 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:38:10,700 INFO L231 Difference]: Finished difference. Result has 142 places, 140 transitions, 864 flow [2024-11-09 10:38:10,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=864, PETRI_PLACES=142, PETRI_TRANSITIONS=140} [2024-11-09 10:38:10,701 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 20 predicate places. [2024-11-09 10:38:10,701 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 140 transitions, 864 flow [2024-11-09 10:38:10,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.666666666666664) internal successors, (340), 6 states have internal predecessors, (340), 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,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:10,701 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:10,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:10,902 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:10,902 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:10,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:10,903 INFO L85 PathProgramCache]: Analyzing trace with hash 386742127, now seen corresponding path program 1 times [2024-11-09 10:38:10,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:10,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2098126617] [2024-11-09 10:38:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:10,903 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,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:10,905 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:10,905 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:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:11,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:38:11,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:11,086 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:11,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:11,087 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:11,089 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:11,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:11,149 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:11,158 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,158 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:11,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2098126617] [2024-11-09 10:38:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2098126617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:11,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402958768] [2024-11-09 10:38:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:11,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-09 10:38:11,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 140 transitions, 864 flow. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:11,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-09 10:38:11,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:12,420 INFO L124 PetriNetUnfolderBase]: 2542/5265 cut-off events. [2024-11-09 10:38:12,420 INFO L125 PetriNetUnfolderBase]: For 17497/17977 co-relation queries the response was YES. [2024-11-09 10:38:12,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16920 conditions, 5265 events. 2542/5265 cut-off events. For 17497/17977 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 41243 event pairs, 1223 based on Foata normal form. 202/5392 useless extension candidates. Maximal degree in co-relation 15468. Up to 3275 conditions per place. [2024-11-09 10:38:12,445 INFO L140 encePairwiseOnDemand]: 124/132 looper letters, 114 selfloop transitions, 35 changer transitions 0/190 dead transitions. [2024-11-09 10:38:12,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 190 transitions, 1488 flow [2024-11-09 10:38:12,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:38:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:38:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 416 transitions. [2024-11-09 10:38:12,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6303030303030303 [2024-11-09 10:38:12,447 INFO L175 Difference]: Start difference. First operand has 142 places, 140 transitions, 864 flow. Second operand 5 states and 416 transitions. [2024-11-09 10:38:12,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 190 transitions, 1488 flow [2024-11-09 10:38:12,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 190 transitions, 1437 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:38:12,474 INFO L231 Difference]: Finished difference. Result has 143 places, 159 transitions, 1155 flow [2024-11-09 10:38:12,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1155, PETRI_PLACES=143, PETRI_TRANSITIONS=159} [2024-11-09 10:38:12,475 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 21 predicate places. [2024-11-09 10:38:12,475 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 159 transitions, 1155 flow [2024-11-09 10:38:12,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 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,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:12,476 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:12,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 10:38:12,676 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:12,677 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:12,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:12,677 INFO L85 PathProgramCache]: Analyzing trace with hash -896002718, now seen corresponding path program 1 times [2024-11-09 10:38:12,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:12,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886662261] [2024-11-09 10:38:12,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:12,678 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,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:12,681 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:12,682 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:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:12,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:38:12,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:13,042 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_81| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_81| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_81|)))) is different from true [2024-11-09 10:38:13,052 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,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:13,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886662261] [2024-11-09 10:38:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886662261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571760233] [2024-11-09 10:38:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:13,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-09 10:38:13,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 132 [2024-11-09 10:38:13,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 159 transitions, 1155 flow. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 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:38:13,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:13,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 132 [2024-11-09 10:38:13,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:14,305 INFO L124 PetriNetUnfolderBase]: 4002/7519 cut-off events. [2024-11-09 10:38:14,305 INFO L125 PetriNetUnfolderBase]: For 24745/24749 co-relation queries the response was YES. [2024-11-09 10:38:14,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26918 conditions, 7519 events. 4002/7519 cut-off events. For 24745/24749 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 57408 event pairs, 1765 based on Foata normal form. 1/7498 useless extension candidates. Maximal degree in co-relation 24825. Up to 3488 conditions per place. [2024-11-09 10:38:14,348 INFO L140 encePairwiseOnDemand]: 106/132 looper letters, 145 selfloop transitions, 40 changer transitions 4/209 dead transitions. [2024-11-09 10:38:14,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 209 transitions, 1801 flow [2024-11-09 10:38:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:38:14,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:38:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 310 transitions. [2024-11-09 10:38:14,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-09 10:38:14,350 INFO L175 Difference]: Start difference. First operand has 143 places, 159 transitions, 1155 flow. Second operand 5 states and 310 transitions. [2024-11-09 10:38:14,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 209 transitions, 1801 flow [2024-11-09 10:38:14,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 209 transitions, 1787 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-09 10:38:14,405 INFO L231 Difference]: Finished difference. Result has 150 places, 177 transitions, 1433 flow [2024-11-09 10:38:14,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1433, PETRI_PLACES=150, PETRI_TRANSITIONS=177} [2024-11-09 10:38:14,405 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 28 predicate places. [2024-11-09 10:38:14,406 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 177 transitions, 1433 flow [2024-11-09 10:38:14,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 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:38:14,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:14,406 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] [2024-11-09 10:38:14,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 10:38:14,607 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:14,607 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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:14,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1071101946, now seen corresponding path program 1 times [2024-11-09 10:38:14,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:14,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825267225] [2024-11-09 10:38:14,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:14,608 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,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:14,609 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:14,612 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:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:14,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:38:14,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:14,794 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,806 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,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:14,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:14,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825267225] [2024-11-09 10:38:14,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825267225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:14,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:14,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:14,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754805023] [2024-11-09 10:38:14,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:14,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:14,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:14,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:14,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:14,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 132 [2024-11-09 10:38:14,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 177 transitions, 1433 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:14,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 132 [2024-11-09 10:38:14,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:15,599 INFO L124 PetriNetUnfolderBase]: 2781/5512 cut-off events. [2024-11-09 10:38:15,599 INFO L125 PetriNetUnfolderBase]: For 27450/27906 co-relation queries the response was YES. [2024-11-09 10:38:15,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22890 conditions, 5512 events. 2781/5512 cut-off events. For 27450/27906 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 42790 event pairs, 1436 based on Foata normal form. 102/5429 useless extension candidates. Maximal degree in co-relation 21367. Up to 3831 conditions per place. [2024-11-09 10:38:15,640 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 103 selfloop transitions, 5 changer transitions 0/183 dead transitions. [2024-11-09 10:38:15,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 183 transitions, 1689 flow [2024-11-09 10:38:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-09 10:38:15,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2024-11-09 10:38:15,642 INFO L175 Difference]: Start difference. First operand has 150 places, 177 transitions, 1433 flow. Second operand 3 states and 257 transitions. [2024-11-09 10:38:15,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 183 transitions, 1689 flow [2024-11-09 10:38:15,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 1601 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-11-09 10:38:15,824 INFO L231 Difference]: Finished difference. Result has 146 places, 175 transitions, 1351 flow [2024-11-09 10:38:15,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1351, PETRI_PLACES=146, PETRI_TRANSITIONS=175} [2024-11-09 10:38:15,825 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 24 predicate places. [2024-11-09 10:38:15,828 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 175 transitions, 1351 flow [2024-11-09 10:38:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:15,829 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:15,829 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] [2024-11-09 10:38:15,851 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 (18)] Ended with exit code 0 [2024-11-09 10:38:16,029 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:16,029 INFO L396 AbstractCegarLoop]: === Iteration 18 === 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:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2033727483, now seen corresponding path program 1 times [2024-11-09 10:38:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149420347] [2024-11-09 10:38:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:16,031 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:16,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:16,033 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:16,033 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:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:16,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:38:16,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:16,263 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:16,269 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:16,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:16,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:16,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149420347] [2024-11-09 10:38:16,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149420347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:16,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:16,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:16,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323687272] [2024-11-09 10:38:16,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:16,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:16,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:16,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:16,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:16,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 132 [2024-11-09 10:38:16,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 175 transitions, 1351 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:16,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:16,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 132 [2024-11-09 10:38:16,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:17,070 INFO L124 PetriNetUnfolderBase]: 2781/5504 cut-off events. [2024-11-09 10:38:17,070 INFO L125 PetriNetUnfolderBase]: For 24828/25284 co-relation queries the response was YES. [2024-11-09 10:38:17,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22496 conditions, 5504 events. 2781/5504 cut-off events. For 24828/25284 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 42690 event pairs, 1436 based on Foata normal form. 102/5421 useless extension candidates. Maximal degree in co-relation 21777. Up to 3831 conditions per place. [2024-11-09 10:38:17,098 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 103 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2024-11-09 10:38:17,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 181 transitions, 1607 flow [2024-11-09 10:38:17,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:17,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2024-11-09 10:38:17,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.648989898989899 [2024-11-09 10:38:17,099 INFO L175 Difference]: Start difference. First operand has 146 places, 175 transitions, 1351 flow. Second operand 3 states and 257 transitions. [2024-11-09 10:38:17,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 181 transitions, 1607 flow [2024-11-09 10:38:17,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 181 transitions, 1597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:17,225 INFO L231 Difference]: Finished difference. Result has 144 places, 173 transitions, 1347 flow [2024-11-09 10:38:17,226 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1337, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1347, PETRI_PLACES=144, PETRI_TRANSITIONS=173} [2024-11-09 10:38:17,227 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 22 predicate places. [2024-11-09 10:38:17,227 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 173 transitions, 1347 flow [2024-11-09 10:38:17,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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:17,227 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:17,228 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:17,236 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:17,428 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:17,428 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:17,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:17,429 INFO L85 PathProgramCache]: Analyzing trace with hash 77536717, now seen corresponding path program 1 times [2024-11-09 10:38:17,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:17,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226221402] [2024-11-09 10:38:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:17,429 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:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:17,431 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:17,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 10:38:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:17,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:38:17,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:17,604 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,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:17,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226221402] [2024-11-09 10:38:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226221402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439216565] [2024-11-09 10:38:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:17,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:17,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:17,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:17,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 132 [2024-11-09 10:38:17,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 173 transitions, 1347 flow. Second operand has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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:17,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:17,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 132 [2024-11-09 10:38:17,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:17,805 INFO L124 PetriNetUnfolderBase]: 265/539 cut-off events. [2024-11-09 10:38:17,805 INFO L125 PetriNetUnfolderBase]: For 1921/1984 co-relation queries the response was YES. [2024-11-09 10:38:17,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 539 events. 265/539 cut-off events. For 1921/1984 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2210 event pairs, 49 based on Foata normal form. 49/568 useless extension candidates. Maximal degree in co-relation 2229. Up to 269 conditions per place. [2024-11-09 10:38:17,808 INFO L140 encePairwiseOnDemand]: 128/132 looper letters, 60 selfloop transitions, 9 changer transitions 0/100 dead transitions. [2024-11-09 10:38:17,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 100 transitions, 688 flow [2024-11-09 10:38:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 335 transitions. [2024-11-09 10:38:17,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.634469696969697 [2024-11-09 10:38:17,810 INFO L175 Difference]: Start difference. First operand has 144 places, 173 transitions, 1347 flow. Second operand 4 states and 335 transitions. [2024-11-09 10:38:17,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 100 transitions, 688 flow [2024-11-09 10:38:17,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 100 transitions, 498 flow, removed 33 selfloop flow, removed 32 redundant places. [2024-11-09 10:38:17,815 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 306 flow [2024-11-09 10:38:17,815 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=306, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2024-11-09 10:38:17,816 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -27 predicate places. [2024-11-09 10:38:17,816 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 306 flow [2024-11-09 10:38:17,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.5) internal successors, (294), 4 states have internal predecessors, (294), 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:17,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:17,816 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, 1, 1, 1] [2024-11-09 10:38:17,825 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 (20)] Ended with exit code 0 [2024-11-09 10:38:18,017 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:18,017 INFO L396 AbstractCegarLoop]: === Iteration 20 === 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:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2089947379, now seen corresponding path program 1 times [2024-11-09 10:38:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681520622] [2024-11-09 10:38:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:18,018 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:18,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:18,019 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:18,020 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:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:18,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:38:18,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:18,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:38:18,361 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:18,361 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:18,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:18,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681520622] [2024-11-09 10:38:18,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681520622] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:18,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:18,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:38:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470065434] [2024-11-09 10:38:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:18,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:38:18,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:18,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:38:18,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:38:18,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-09 10:38:18,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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:18,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:18,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-09 10:38:18,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:19,008 INFO L124 PetriNetUnfolderBase]: 294/623 cut-off events. [2024-11-09 10:38:19,009 INFO L125 PetriNetUnfolderBase]: For 913/919 co-relation queries the response was YES. [2024-11-09 10:38:19,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1904 conditions, 623 events. 294/623 cut-off events. For 913/919 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2767 event pairs, 28 based on Foata normal form. 15/628 useless extension candidates. Maximal degree in co-relation 1892. Up to 192 conditions per place. [2024-11-09 10:38:19,011 INFO L140 encePairwiseOnDemand]: 123/132 looper letters, 76 selfloop transitions, 29 changer transitions 0/136 dead transitions. [2024-11-09 10:38:19,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 136 transitions, 768 flow [2024-11-09 10:38:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:38:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:38:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 861 transitions. [2024-11-09 10:38:19,014 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5929752066115702 [2024-11-09 10:38:19,014 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 306 flow. Second operand 11 states and 861 transitions. [2024-11-09 10:38:19,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 136 transitions, 768 flow [2024-11-09 10:38:19,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 136 transitions, 732 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:19,019 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 483 flow [2024-11-09 10:38:19,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=483, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2024-11-09 10:38:19,020 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:38:19,020 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 483 flow [2024-11-09 10:38:19,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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:19,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:19,021 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, 1, 1, 1] [2024-11-09 10:38:19,031 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 (21)] Ended with exit code 0 [2024-11-09 10:38:19,221 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:19,221 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:19,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 653982341, now seen corresponding path program 2 times [2024-11-09 10:38:19,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:19,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000497464] [2024-11-09 10:38:19,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:38:19,223 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:19,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:19,224 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:19,225 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:19,474 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:38:19,475 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:38:19,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:38:19,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:19,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:38:19,571 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:19,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:19,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000497464] [2024-11-09 10:38:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000497464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:19,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:19,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:38:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235260826] [2024-11-09 10:38:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:38:19,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:38:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:38:19,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-09 10:38:19,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 483 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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:19,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:19,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-09 10:38:19,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:20,345 INFO L124 PetriNetUnfolderBase]: 328/700 cut-off events. [2024-11-09 10:38:20,345 INFO L125 PetriNetUnfolderBase]: For 1617/1636 co-relation queries the response was YES. [2024-11-09 10:38:20,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 700 events. 328/700 cut-off events. For 1617/1636 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3261 event pairs, 44 based on Foata normal form. 18/707 useless extension candidates. Maximal degree in co-relation 2422. Up to 219 conditions per place. [2024-11-09 10:38:20,350 INFO L140 encePairwiseOnDemand]: 123/132 looper letters, 80 selfloop transitions, 42 changer transitions 0/153 dead transitions. [2024-11-09 10:38:20,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 153 transitions, 1048 flow [2024-11-09 10:38:20,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:38:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:38:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 861 transitions. [2024-11-09 10:38:20,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5929752066115702 [2024-11-09 10:38:20,353 INFO L175 Difference]: Start difference. First operand has 106 places, 99 transitions, 483 flow. Second operand 11 states and 861 transitions. [2024-11-09 10:38:20,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 153 transitions, 1048 flow [2024-11-09 10:38:20,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 153 transitions, 1002 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-11-09 10:38:20,359 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 739 flow [2024-11-09 10:38:20,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=739, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2024-11-09 10:38:20,360 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -7 predicate places. [2024-11-09 10:38:20,360 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 739 flow [2024-11-09 10:38:20,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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:20,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:20,361 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, 1, 1, 1] [2024-11-09 10:38:20,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:20,561 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:20,561 INFO L396 AbstractCegarLoop]: === Iteration 22 === 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:20,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:20,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1818691607, now seen corresponding path program 3 times [2024-11-09 10:38:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546090598] [2024-11-09 10:38:20,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:38:20,563 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:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:20,564 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:20,565 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:20,875 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:38:20,875 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:38:20,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:38:20,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:20,895 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:20,902 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:21,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:21,204 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:21,216 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:21,216 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:21,259 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:21,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:21,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:21,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546090598] [2024-11-09 10:38:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546090598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70951004] [2024-11-09 10:38:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:21,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:21,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:21,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 132 [2024-11-09 10:38:21,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 739 flow. Second operand has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 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:21,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:21,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 132 [2024-11-09 10:38:21,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:21,681 INFO L124 PetriNetUnfolderBase]: 327/681 cut-off events. [2024-11-09 10:38:21,682 INFO L125 PetriNetUnfolderBase]: For 2133/2159 co-relation queries the response was YES. [2024-11-09 10:38:21,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2718 conditions, 681 events. 327/681 cut-off events. For 2133/2159 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3139 event pairs, 196 based on Foata normal form. 7/666 useless extension candidates. Maximal degree in co-relation 2698. Up to 594 conditions per place. [2024-11-09 10:38:21,686 INFO L140 encePairwiseOnDemand]: 122/132 looper letters, 86 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2024-11-09 10:38:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 907 flow [2024-11-09 10:38:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2024-11-09 10:38:21,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5132575757575758 [2024-11-09 10:38:21,687 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 739 flow. Second operand 4 states and 271 transitions. [2024-11-09 10:38:21,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 907 flow [2024-11-09 10:38:21,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 112 transitions, 845 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-11-09 10:38:21,694 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 673 flow [2024-11-09 10:38:21,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=673, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2024-11-09 10:38:21,694 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -15 predicate places. [2024-11-09 10:38:21,694 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 673 flow [2024-11-09 10:38:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 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:21,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:21,695 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, 1, 1, 1] [2024-11-09 10:38:21,705 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 (23)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:21,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:21,896 INFO L396 AbstractCegarLoop]: === Iteration 23 === 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:21,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash 616098376, now seen corresponding path program 1 times [2024-11-09 10:38:21,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13239408] [2024-11-09 10:38:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:21,897 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:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:21,898 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 10:38:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:22,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:38:22,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:22,206 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:22,282 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 10:38:22,282 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:22,320 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:22,323 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:22,323 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:22,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:22,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13239408] [2024-11-09 10:38:22,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13239408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:22,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:22,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:22,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376222710] [2024-11-09 10:38:22,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:22,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:22,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:22,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:22,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 132 [2024-11-09 10:38:22,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 673 flow. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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:22,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:22,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 132 [2024-11-09 10:38:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:22,760 INFO L124 PetriNetUnfolderBase]: 327/680 cut-off events. [2024-11-09 10:38:22,760 INFO L125 PetriNetUnfolderBase]: For 1576/1602 co-relation queries the response was YES. [2024-11-09 10:38:22,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 680 events. 327/680 cut-off events. For 1576/1602 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3203 event pairs, 137 based on Foata normal form. 7/667 useless extension candidates. Maximal degree in co-relation 2611. Up to 407 conditions per place. [2024-11-09 10:38:22,763 INFO L140 encePairwiseOnDemand]: 127/132 looper letters, 96 selfloop transitions, 7 changer transitions 0/125 dead transitions. [2024-11-09 10:38:22,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 125 transitions, 973 flow [2024-11-09 10:38:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2024-11-09 10:38:22,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5511363636363636 [2024-11-09 10:38:22,764 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 673 flow. Second operand 4 states and 291 transitions. [2024-11-09 10:38:22,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 125 transitions, 973 flow [2024-11-09 10:38:22,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 125 transitions, 965 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:22,769 INFO L231 Difference]: Finished difference. Result has 106 places, 111 transitions, 677 flow [2024-11-09 10:38:22,769 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=677, PETRI_PLACES=106, PETRI_TRANSITIONS=111} [2024-11-09 10:38:22,770 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-09 10:38:22,770 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 111 transitions, 677 flow [2024-11-09 10:38:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 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:22,770 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:22,770 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, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:22,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-09 10:38:22,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:22,971 INFO L396 AbstractCegarLoop]: === Iteration 24 === 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:22,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:22,971 INFO L85 PathProgramCache]: Analyzing trace with hash -125265219, now seen corresponding path program 1 times [2024-11-09 10:38:22,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:22,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491604701] [2024-11-09 10:38:22,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:22,972 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:22,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:22,973 INFO L229 MonitoredProcess]: Starting monitored process 25 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:22,974 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 (25)] Waiting until timeout for monitored process [2024-11-09 10:38:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:23,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 10:38:23,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:23,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:23,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:23,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:23,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:23,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:23,515 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:23,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:23,574 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 69 treesize of output 45 [2024-11-09 10:38:23,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:23,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 45 [2024-11-09 10:38:23,722 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:23,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:23,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:23,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491604701] [2024-11-09 10:38:23,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491604701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:23,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:23,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:38:23,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925336485] [2024-11-09 10:38:23,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:23,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:38:23,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:23,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:38:23,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:38:24,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 132 [2024-11-09 10:38:24,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 111 transitions, 677 flow. Second operand has 8 states, 8 states have (on average 69.125) internal successors, (553), 8 states have internal predecessors, (553), 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:24,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:24,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 132 [2024-11-09 10:38:24,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:25,358 INFO L124 PetriNetUnfolderBase]: 483/977 cut-off events. [2024-11-09 10:38:25,358 INFO L125 PetriNetUnfolderBase]: For 2061/2061 co-relation queries the response was YES. [2024-11-09 10:38:25,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3744 conditions, 977 events. 483/977 cut-off events. For 2061/2061 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4803 event pairs, 52 based on Foata normal form. 1/972 useless extension candidates. Maximal degree in co-relation 3724. Up to 291 conditions per place. [2024-11-09 10:38:25,364 INFO L140 encePairwiseOnDemand]: 120/132 looper letters, 115 selfloop transitions, 44 changer transitions 0/176 dead transitions. [2024-11-09 10:38:25,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 176 transitions, 1378 flow [2024-11-09 10:38:25,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:38:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:38:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 755 transitions. [2024-11-09 10:38:25,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.571969696969697 [2024-11-09 10:38:25,366 INFO L175 Difference]: Start difference. First operand has 106 places, 111 transitions, 677 flow. Second operand 10 states and 755 transitions. [2024-11-09 10:38:25,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 176 transitions, 1378 flow [2024-11-09 10:38:25,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 176 transitions, 1358 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:25,375 INFO L231 Difference]: Finished difference. Result has 115 places, 123 transitions, 870 flow [2024-11-09 10:38:25,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=870, PETRI_PLACES=115, PETRI_TRANSITIONS=123} [2024-11-09 10:38:25,376 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -7 predicate places. [2024-11-09 10:38:25,376 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 123 transitions, 870 flow [2024-11-09 10:38:25,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 69.125) internal successors, (553), 8 states have internal predecessors, (553), 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:25,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:25,377 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, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:25,387 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 (25)] Ended with exit code 0 [2024-11-09 10:38:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:25,577 INFO L396 AbstractCegarLoop]: === Iteration 25 === 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:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1476178867, now seen corresponding path program 2 times [2024-11-09 10:38:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:25,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582919306] [2024-11-09 10:38:25,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:38:25,579 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:25,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:25,582 INFO L229 MonitoredProcess]: Starting monitored process 26 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:25,583 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 (26)] Waiting until timeout for monitored process [2024-11-09 10:38:25,852 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:38:25,852 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:38:25,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:38:25,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:25,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:38:25,951 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:25,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:25,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582919306] [2024-11-09 10:38:25,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582919306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:25,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:38:25,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289004063] [2024-11-09 10:38:25,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:25,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:38:25,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:25,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:38:25,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:38:26,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-09 10:38:26,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 123 transitions, 870 flow. Second operand has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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:26,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:26,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-09 10:38:26,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:26,706 INFO L124 PetriNetUnfolderBase]: 534/1184 cut-off events. [2024-11-09 10:38:26,706 INFO L125 PetriNetUnfolderBase]: For 3727/3756 co-relation queries the response was YES. [2024-11-09 10:38:26,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 1184 events. 534/1184 cut-off events. For 3727/3756 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6556 event pairs, 87 based on Foata normal form. 42/1206 useless extension candidates. Maximal degree in co-relation 4740. Up to 385 conditions per place. [2024-11-09 10:38:26,712 INFO L140 encePairwiseOnDemand]: 123/132 looper letters, 114 selfloop transitions, 66 changer transitions 0/208 dead transitions. [2024-11-09 10:38:26,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 208 transitions, 1740 flow [2024-11-09 10:38:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 10:38:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-09 10:38:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1039 transitions. [2024-11-09 10:38:26,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054778554778555 [2024-11-09 10:38:26,714 INFO L175 Difference]: Start difference. First operand has 115 places, 123 transitions, 870 flow. Second operand 13 states and 1039 transitions. [2024-11-09 10:38:26,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 208 transitions, 1740 flow [2024-11-09 10:38:26,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 208 transitions, 1691 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-09 10:38:26,729 INFO L231 Difference]: Finished difference. Result has 129 places, 143 transitions, 1277 flow [2024-11-09 10:38:26,729 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1277, PETRI_PLACES=129, PETRI_TRANSITIONS=143} [2024-11-09 10:38:26,729 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 7 predicate places. [2024-11-09 10:38:26,730 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 143 transitions, 1277 flow [2024-11-09 10:38:26,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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:26,730 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:26,730 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, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:26,741 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 (26)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:26,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:26,931 INFO L396 AbstractCegarLoop]: === Iteration 26 === 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:26,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:26,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1518858053, now seen corresponding path program 3 times [2024-11-09 10:38:26,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:26,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400646365] [2024-11-09 10:38:26,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:38:26,933 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:26,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:26,936 INFO L229 MonitoredProcess]: Starting monitored process 27 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:26,937 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 (27)] Waiting until timeout for monitored process [2024-11-09 10:38:27,210 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:38:27,210 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:38:27,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:38:27,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:27,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:38:27,293 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:27,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:27,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:27,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400646365] [2024-11-09 10:38:27,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400646365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:27,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:27,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:38:27,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533262452] [2024-11-09 10:38:27,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:27,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:38:27,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:27,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:38:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:38:27,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 132 [2024-11-09 10:38:27,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 143 transitions, 1277 flow. Second operand has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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:27,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:27,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 132 [2024-11-09 10:38:27,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:28,000 INFO L124 PetriNetUnfolderBase]: 344/841 cut-off events. [2024-11-09 10:38:28,000 INFO L125 PetriNetUnfolderBase]: For 4154/4175 co-relation queries the response was YES. [2024-11-09 10:38:28,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3665 conditions, 841 events. 344/841 cut-off events. For 4154/4175 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4163 event pairs, 61 based on Foata normal form. 31/859 useless extension candidates. Maximal degree in co-relation 3636. Up to 259 conditions per place. [2024-11-09 10:38:28,005 INFO L140 encePairwiseOnDemand]: 123/132 looper letters, 105 selfloop transitions, 56 changer transitions 0/189 dead transitions. [2024-11-09 10:38:28,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 189 transitions, 1768 flow [2024-11-09 10:38:28,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:38:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:38:28,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 884 transitions. [2024-11-09 10:38:28,006 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6088154269972452 [2024-11-09 10:38:28,007 INFO L175 Difference]: Start difference. First operand has 129 places, 143 transitions, 1277 flow. Second operand 11 states and 884 transitions. [2024-11-09 10:38:28,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 189 transitions, 1768 flow [2024-11-09 10:38:28,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 189 transitions, 1605 flow, removed 49 selfloop flow, removed 8 redundant places. [2024-11-09 10:38:28,020 INFO L231 Difference]: Finished difference. Result has 137 places, 141 transitions, 1367 flow [2024-11-09 10:38:28,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=1028, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1367, PETRI_PLACES=137, PETRI_TRANSITIONS=141} [2024-11-09 10:38:28,021 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 15 predicate places. [2024-11-09 10:38:28,021 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 141 transitions, 1367 flow [2024-11-09 10:38:28,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 74.14285714285714) internal successors, (519), 7 states have internal predecessors, (519), 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:28,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:28,022 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, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:28,029 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 (27)] Ended with exit code 0 [2024-11-09 10:38:28,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:28,222 INFO L396 AbstractCegarLoop]: === Iteration 27 === 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:28,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:28,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2125892883, now seen corresponding path program 4 times [2024-11-09 10:38:28,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:28,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453486994] [2024-11-09 10:38:28,223 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:38:28,223 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:28,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:28,225 INFO L229 MonitoredProcess]: Starting monitored process 28 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:28,225 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 (28)] Waiting until timeout for monitored process [2024-11-09 10:38:28,545 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:38:28,545 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:38:28,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 10:38:28,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:28,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:28,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:28,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:28,744 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:28,745 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:28,746 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:28,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:28,830 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 66 treesize of output 75 [2024-11-09 10:38:31,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:31,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 123 treesize of output 63 [2024-11-09 10:38:31,151 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:31,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:31,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453486994] [2024-11-09 10:38:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453486994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 10:38:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024670946] [2024-11-09 10:38:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:38:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:38:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=54, Unknown=1, NotChecked=0, Total=72 [2024-11-09 10:38:33,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:35,069 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:37,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:39,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s 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,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s 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,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s 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,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:46,607 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:48,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s 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,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s 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,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:56,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:38:58,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:00,634 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:02,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.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:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:06,572 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:08,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 10:39:10,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s 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,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]