./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:26:20,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:26:20,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:26:20,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:26:20,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:26:20,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:26:20,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:26:20,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:26:20,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:26:20,320 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:26:20,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:26:20,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:26:20,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:26:20,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:26:20,322 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:26:20,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:26:20,323 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:26:20,323 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:26:20,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:26:20,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:26:20,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:26:20,331 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:26:20,332 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:26:20,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:26:20,332 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:26:20,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:26:20,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:26:20,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:26:20,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:26:20,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:26:20,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:26:20,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:26:20,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:26:20,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:26:20,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:26:20,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:26:20,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:26:20,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:26:20,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:26:20,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:26:20,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:26:20,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:26:20,341 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-10-13 12:26:20,653 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:26:20,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:26:20,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:26:20,686 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:26:20,686 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:26:20,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-10-13 12:26:22,361 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:26:22,704 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:26:22,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-10-13 12:26:22,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77bc6da7/c2091e6d42134cc5810ff7590318d5e3/FLAGf57ca1af4 [2024-10-13 12:26:22,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a77bc6da7/c2091e6d42134cc5810ff7590318d5e3 [2024-10-13 12:26:22,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:26:22,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:26:22,775 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:22,775 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:26:22,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:26:22,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:22" (1/1) ... [2024-10-13 12:26:22,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464402be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:22, skipping insertion in model container [2024-10-13 12:26:22,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:22" (1/1) ... [2024-10-13 12:26:22,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:26:23,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:23,530 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-10-13 12:26:23,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6e1daf57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:23, skipping insertion in model container [2024-10-13 12:26:23,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:23,531 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:26:23,533 INFO L158 Benchmark]: Toolchain (without parser) took 758.55ms. Allocated memory is still 190.8MB. Free memory was 120.7MB in the beginning and 159.7MB in the end (delta: -39.0MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-10-13 12:26:23,534 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:26:23,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 756.33ms. Allocated memory is still 190.8MB. Free memory was 120.4MB in the beginning and 159.7MB in the end (delta: -39.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-10-13 12:26:23,536 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 109.1MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 756.33ms. Allocated memory is still 190.8MB. Free memory was 120.4MB in the beginning and 159.7MB in the end (delta: -39.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:26:25,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:26:25,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:26:25,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:26:25,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:26:25,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:26:25,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:26:25,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:26:25,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:26:25,918 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:26:25,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:26:25,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:26:25,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:26:25,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:26:25,920 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:26:25,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:26:25,925 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:26:25,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:26:25,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:26:25,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:26:25,926 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:26:25,931 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:26:25,931 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:26:25,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:26:25,932 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:26:25,932 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:26:25,932 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:26:25,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:26:25,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:26:25,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:26:25,933 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:26:25,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:26:25,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:26:25,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:26:25,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:26:25,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:26:25,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:26:25,938 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:26:25,938 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:26:25,938 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:26:25,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:26:25,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:26:25,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:26:25,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:26:25,940 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:26:25,940 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-10-13 12:26:26,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:26:26,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:26:26,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:26:26,370 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:26:26,371 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:26:26,372 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-10-13 12:26:28,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:26:28,545 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:26:28,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-10-13 12:26:28,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf32b207/914a1ef841a145cbb525d9d886712954/FLAGce41ac627 [2024-10-13 12:26:28,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acf32b207/914a1ef841a145cbb525d9d886712954 [2024-10-13 12:26:28,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:26:28,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:26:28,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:28,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:26:28,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:26:28,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:28" (1/1) ... [2024-10-13 12:26:28,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ce75e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:28, skipping insertion in model container [2024-10-13 12:26:28,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:26:28" (1/1) ... [2024-10-13 12:26:28,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:26:29,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:29,324 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:26:29,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:26:29,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:29,406 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:26:29,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:26:29,531 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:26:29,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29 WrapperNode [2024-10-13 12:26:29,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:26:29,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:26:29,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:26:29,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:26:29,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,626 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-10-13 12:26:29,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:26:29,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:26:29,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:26:29,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:26:29,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,687 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 15, 2]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 8, 2]. [2024-10-13 12:26:29,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,739 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,759 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:26:29,760 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:26:29,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:26:29,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:26:29,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (1/1) ... [2024-10-13 12:26:29,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:26:29,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:26:29,809 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-10-13 12:26:29,815 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-10-13 12:26:29,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:26:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:26:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:26:29,866 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-13 12:26:29,866 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-13 12:26:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 12:26:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:26:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:26:29,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:26:29,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:26:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:26:29,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:26:29,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:26:29,873 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:26:30,250 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:26:30,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:26:30,880 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:26:30,880 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:26:31,112 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:26:31,112 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:26:31,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:31 BoogieIcfgContainer [2024-10-13 12:26:31,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:26:31,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:26:31,117 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:26:31,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:26:31,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:26:28" (1/3) ... [2024-10-13 12:26:31,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202927bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:26:31, skipping insertion in model container [2024-10-13 12:26:31,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:26:29" (2/3) ... [2024-10-13 12:26:31,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202927bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:26:31, skipping insertion in model container [2024-10-13 12:26:31,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:31" (3/3) ... [2024-10-13 12:26:31,127 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-10-13 12:26:31,148 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:26:31,149 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-13 12:26:31,149 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:26:31,230 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 12:26:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-10-13 12:26:31,336 INFO L124 PetriNetUnfolderBase]: 14/157 cut-off events. [2024-10-13 12:26:31,337 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:26:31,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 14/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 501 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-10-13 12:26:31,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-10-13 12:26:31,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-10-13 12:26:31,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:26:31,371 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;@36439e8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:26:31,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-13 12:26:31,374 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:26:31,375 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 12:26:31,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:26:31,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:31,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:26:31,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:31,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash 561254, now seen corresponding path program 1 times [2024-10-13 12:26:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:31,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985560042] [2024-10-13 12:26:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:31,395 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-10-13 12:26:31,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:31,397 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-10-13 12:26:31,398 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-10-13 12:26:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:31,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:26:31,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:31,627 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-10-13 12:26:31,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:31,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:31,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:31,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985560042] [2024-10-13 12:26:31,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985560042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:31,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:31,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:31,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836786672] [2024-10-13 12:26:31,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:31,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:31,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:31,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:31,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-10-13 12:26:31,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:31,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:31,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-10-13 12:26:31,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:33,816 INFO L124 PetriNetUnfolderBase]: 4409/10835 cut-off events. [2024-10-13 12:26:33,817 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-13 12:26:33,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 10835 events. 4409/10835 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 111305 event pairs, 559 based on Foata normal form. 792/8156 useless extension candidates. Maximal degree in co-relation 16922. Up to 6052 conditions per place. [2024-10-13 12:26:33,934 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-10-13 12:26:33,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 472 flow [2024-10-13 12:26:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-10-13 12:26:33,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-10-13 12:26:33,953 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 226 transitions. [2024-10-13 12:26:33,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 472 flow [2024-10-13 12:26:33,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:26:33,967 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-10-13 12:26:33,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-10-13 12:26:33,975 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-10-13 12:26:33,976 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-10-13 12:26:33,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:33,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:33,977 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:26:33,985 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-10-13 12:26:34,181 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-10-13 12:26:34,182 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:34,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:34,183 INFO L85 PathProgramCache]: Analyzing trace with hash 561255, now seen corresponding path program 1 times [2024-10-13 12:26:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044996259] [2024-10-13 12:26:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:34,184 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-10-13 12:26:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:34,186 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-10-13 12:26:34,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:26:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:34,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:26:34,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:34,307 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-10-13 12:26:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:34,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:34,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:34,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044996259] [2024-10-13 12:26:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044996259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:34,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:34,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:34,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719356223] [2024-10-13 12:26:34,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:34,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:34,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:34,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:34,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:26:34,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:34,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:34,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:26:34,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:35,900 INFO L124 PetriNetUnfolderBase]: 4409/10833 cut-off events. [2024-10-13 12:26:35,901 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-10-13 12:26:35,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18083 conditions, 10833 events. 4409/10833 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 111595 event pairs, 559 based on Foata normal form. 1/7363 useless extension candidates. Maximal degree in co-relation 1994. Up to 6052 conditions per place. [2024-10-13 12:26:35,986 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-10-13 12:26:35,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 462 flow [2024-10-13 12:26:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-10-13 12:26:35,989 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-10-13 12:26:35,990 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 220 transitions. [2024-10-13 12:26:35,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 462 flow [2024-10-13 12:26:35,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:35,994 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-10-13 12:26:35,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2024-10-13 12:26:35,996 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-10-13 12:26:35,996 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-10-13 12:26:35,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:35,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:35,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 12:26:36,004 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:36,197 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-10-13 12:26:36,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:36,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 17397141, now seen corresponding path program 1 times [2024-10-13 12:26:36,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:36,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769641466] [2024-10-13 12:26:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:36,200 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-10-13 12:26:36,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:36,202 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-10-13 12:26:36,203 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-10-13 12:26:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:36,321 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:26:36,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:36,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:36,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:36,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769641466] [2024-10-13 12:26:36,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769641466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:36,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:36,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:36,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551204024] [2024-10-13 12:26:36,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:36,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:36,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:36,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:36,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:36,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-10-13 12:26:36,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:36,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:36,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-10-13 12:26:36,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:37,586 INFO L124 PetriNetUnfolderBase]: 4408/8077 cut-off events. [2024-10-13 12:26:37,587 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-10-13 12:26:37,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15327 conditions, 8077 events. 4408/8077 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 62053 event pairs, 4043 based on Foata normal form. 1/5576 useless extension candidates. Maximal degree in co-relation 7647. Up to 6473 conditions per place. [2024-10-13 12:26:37,649 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-10-13 12:26:37,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 460 flow [2024-10-13 12:26:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:37,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-10-13 12:26:37,655 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2024-10-13 12:26:37,655 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 222 transitions. [2024-10-13 12:26:37,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 460 flow [2024-10-13 12:26:37,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:37,660 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-10-13 12:26:37,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2024-10-13 12:26:37,661 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-10-13 12:26:37,662 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-10-13 12:26:37,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:37,662 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:37,662 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:37,669 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-10-13 12:26:37,863 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-10-13 12:26:37,864 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:37,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:37,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1675627661, now seen corresponding path program 1 times [2024-10-13 12:26:37,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:37,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852377263] [2024-10-13 12:26:37,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:37,866 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-10-13 12:26:37,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:37,868 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-10-13 12:26:37,870 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-10-13 12:26:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:38,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:26:38,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:38,014 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-10-13 12:26:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:38,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:38,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852377263] [2024-10-13 12:26:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852377263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:38,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:38,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:38,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562681519] [2024-10-13 12:26:38,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:38,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:38,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:38,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-10-13 12:26:38,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:38,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:38,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-10-13 12:26:38,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:39,214 INFO L124 PetriNetUnfolderBase]: 5136/9326 cut-off events. [2024-10-13 12:26:39,214 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-13 12:26:39,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17699 conditions, 9326 events. 5136/9326 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 71026 event pairs, 4407 based on Foata normal form. 0/6615 useless extension candidates. Maximal degree in co-relation 16374. Up to 7032 conditions per place. [2024-10-13 12:26:39,264 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 94 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2024-10-13 12:26:39,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 126 transitions, 456 flow [2024-10-13 12:26:39,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-10-13 12:26:39,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-10-13 12:26:39,266 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 3 states and 208 transitions. [2024-10-13 12:26:39,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 126 transitions, 456 flow [2024-10-13 12:26:39,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:39,285 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 212 flow [2024-10-13 12:26:39,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2024-10-13 12:26:39,286 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -15 predicate places. [2024-10-13 12:26:39,286 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 212 flow [2024-10-13 12:26:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:39,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:39,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:39,296 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-10-13 12:26:39,488 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-10-13 12:26:39,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:39,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1675627662, now seen corresponding path program 1 times [2024-10-13 12:26:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280172255] [2024-10-13 12:26:39,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:39,495 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-10-13 12:26:39,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:39,498 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-10-13 12:26:39,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:26:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:39,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:26:39,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:39,650 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-10-13 12:26:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:39,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:39,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:39,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280172255] [2024-10-13 12:26:39,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280172255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:39,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:39,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:26:39,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30908932] [2024-10-13 12:26:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:39,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:26:39,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:39,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:26:39,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:26:39,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 124 [2024-10-13 12:26:39,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:39,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:39,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 124 [2024-10-13 12:26:39,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:40,747 INFO L124 PetriNetUnfolderBase]: 4408/8143 cut-off events. [2024-10-13 12:26:40,747 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-10-13 12:26:40,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15409 conditions, 8143 events. 4408/8143 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 62979 event pairs, 3107 based on Foata normal form. 394/6163 useless extension candidates. Maximal degree in co-relation 12508. Up to 4910 conditions per place. [2024-10-13 12:26:40,805 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 105 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2024-10-13 12:26:40,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 133 transitions, 496 flow [2024-10-13 12:26:40,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:26:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:26:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-10-13 12:26:40,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5994623655913979 [2024-10-13 12:26:40,808 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 212 flow. Second operand 3 states and 223 transitions. [2024-10-13 12:26:40,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 133 transitions, 496 flow [2024-10-13 12:26:40,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 133 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:40,829 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 225 flow [2024-10-13 12:26:40,830 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2024-10-13 12:26:40,832 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -14 predicate places. [2024-10-13 12:26:40,832 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 225 flow [2024-10-13 12:26:40,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:40,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:40,832 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:40,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:26:41,036 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-10-13 12:26:41,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:41,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash 480476947, now seen corresponding path program 1 times [2024-10-13 12:26:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:41,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989999462] [2024-10-13 12:26:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:41,039 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-10-13 12:26:41,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:41,043 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-10-13 12:26:41,046 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-10-13 12:26:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:41,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:26:41,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:41,195 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-10-13 12:26:41,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:41,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:41,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:41,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989999462] [2024-10-13 12:26:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989999462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:41,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221152137] [2024-10-13 12:26:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:41,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:41,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:41,476 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:41,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:41,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:41,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:41,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:42,811 INFO L124 PetriNetUnfolderBase]: 3844/8036 cut-off events. [2024-10-13 12:26:42,811 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-10-13 12:26:42,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14925 conditions, 8036 events. 3844/8036 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 68062 event pairs, 55 based on Foata normal form. 0/6221 useless extension candidates. Maximal degree in co-relation 9104. Up to 3713 conditions per place. [2024-10-13 12:26:42,853 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 169 selfloop transitions, 13 changer transitions 1/214 dead transitions. [2024-10-13 12:26:42,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 214 transitions, 830 flow [2024-10-13 12:26:42,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:26:42,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:26:42,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 534 transitions. [2024-10-13 12:26:42,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5383064516129032 [2024-10-13 12:26:42,857 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 225 flow. Second operand 8 states and 534 transitions. [2024-10-13 12:26:42,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 214 transitions, 830 flow [2024-10-13 12:26:42,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 214 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:26:42,873 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 313 flow [2024-10-13 12:26:42,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2024-10-13 12:26:42,875 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2024-10-13 12:26:42,876 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 313 flow [2024-10-13 12:26:42,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:42,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:42,878 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:42,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:43,078 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-10-13 12:26:43,079 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 480476948, now seen corresponding path program 1 times [2024-10-13 12:26:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630763673] [2024-10-13 12:26:43,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:43,081 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-10-13 12:26:43,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:43,084 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-10-13 12:26:43,085 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-10-13 12:26:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:43,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 12:26:43,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:43,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-10-13 12:26:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:43,336 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:43,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630763673] [2024-10-13 12:26:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630763673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:43,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:43,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994212400] [2024-10-13 12:26:43,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:43,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:43,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:43,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:43,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:43,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:43,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:43,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:43,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:44,651 INFO L124 PetriNetUnfolderBase]: 2867/6073 cut-off events. [2024-10-13 12:26:44,652 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-10-13 12:26:44,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12538 conditions, 6073 events. 2867/6073 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48858 event pairs, 125 based on Foata normal form. 524/5654 useless extension candidates. Maximal degree in co-relation 11075. Up to 3099 conditions per place. [2024-10-13 12:26:44,689 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 151 selfloop transitions, 10 changer transitions 2/194 dead transitions. [2024-10-13 12:26:44,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 194 transitions, 827 flow [2024-10-13 12:26:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:26:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:26:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 465 transitions. [2024-10-13 12:26:44,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-10-13 12:26:44,692 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 313 flow. Second operand 7 states and 465 transitions. [2024-10-13 12:26:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 194 transitions, 827 flow [2024-10-13 12:26:44,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:26:44,720 INFO L231 Difference]: Finished difference. Result has 123 places, 112 transitions, 366 flow [2024-10-13 12:26:44,720 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=123, PETRI_TRANSITIONS=112} [2024-10-13 12:26:44,721 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2024-10-13 12:26:44,721 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 112 transitions, 366 flow [2024-10-13 12:26:44,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:44,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:44,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:44,730 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:44,923 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-10-13 12:26:44,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:44,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash 458561999, now seen corresponding path program 1 times [2024-10-13 12:26:44,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:44,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970258974] [2024-10-13 12:26:44,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:44,925 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-10-13 12:26:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:44,928 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-10-13 12:26:44,930 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-10-13 12:26:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:45,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:26:45,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:45,084 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-10-13 12:26:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:45,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:45,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970258974] [2024-10-13 12:26:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970258974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709973819] [2024-10-13 12:26:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:45,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:45,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:45,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:45,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:45,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:45,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 112 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:45,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:45,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:45,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:46,298 INFO L124 PetriNetUnfolderBase]: 2636/5484 cut-off events. [2024-10-13 12:26:46,298 INFO L125 PetriNetUnfolderBase]: For 3778/3778 co-relation queries the response was YES. [2024-10-13 12:26:46,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12310 conditions, 5484 events. 2636/5484 cut-off events. For 3778/3778 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 42612 event pairs, 191 based on Foata normal form. 0/4807 useless extension candidates. Maximal degree in co-relation 10986. Up to 2221 conditions per place. [2024-10-13 12:26:46,331 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 174 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-10-13 12:26:46,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 222 transitions, 1105 flow [2024-10-13 12:26:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 12:26:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 12:26:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2024-10-13 12:26:46,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2024-10-13 12:26:46,334 INFO L175 Difference]: Start difference. First operand has 123 places, 112 transitions, 366 flow. Second operand 8 states and 530 transitions. [2024-10-13 12:26:46,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 222 transitions, 1105 flow [2024-10-13 12:26:46,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 222 transitions, 1075 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:26:46,346 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 469 flow [2024-10-13 12:26:46,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=469, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-10-13 12:26:46,347 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2024-10-13 12:26:46,347 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 469 flow [2024-10-13 12:26:46,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:46,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:46,348 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:46,354 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-10-13 12:26:46,548 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-10-13 12:26:46,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 458562000, now seen corresponding path program 1 times [2024-10-13 12:26:46,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:46,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495724325] [2024-10-13 12:26:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:46,550 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-10-13 12:26:46,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:46,552 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-10-13 12:26:46,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 (10)] Waiting until timeout for monitored process [2024-10-13 12:26:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:46,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 12:26:46,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:46,708 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-10-13 12:26:46,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:46,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:46,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:46,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495724325] [2024-10-13 12:26:46,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495724325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:46,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818998090] [2024-10-13 12:26:46,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:46,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:46,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:46,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:26:47,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:47,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:47,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:47,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:47,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:48,001 INFO L124 PetriNetUnfolderBase]: 1987/4195 cut-off events. [2024-10-13 12:26:48,001 INFO L125 PetriNetUnfolderBase]: For 4454/4456 co-relation queries the response was YES. [2024-10-13 12:26:48,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10529 conditions, 4195 events. 1987/4195 cut-off events. For 4454/4456 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 30960 event pairs, 384 based on Foata normal form. 378/4449 useless extension candidates. Maximal degree in co-relation 9449. Up to 2291 conditions per place. [2024-10-13 12:26:48,021 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 145 selfloop transitions, 14 changer transitions 1/191 dead transitions. [2024-10-13 12:26:48,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 191 transitions, 1027 flow [2024-10-13 12:26:48,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 12:26:48,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 12:26:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 448 transitions. [2024-10-13 12:26:48,024 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-10-13 12:26:48,024 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 469 flow. Second operand 7 states and 448 transitions. [2024-10-13 12:26:48,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 191 transitions, 1027 flow [2024-10-13 12:26:48,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 191 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:26:48,037 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 540 flow [2024-10-13 12:26:48,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2024-10-13 12:26:48,038 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2024-10-13 12:26:48,038 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 540 flow [2024-10-13 12:26:48,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:48,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:48,039 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:48,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:48,239 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-10-13 12:26:48,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1841625201, now seen corresponding path program 1 times [2024-10-13 12:26:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847041833] [2024-10-13 12:26:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:48,241 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-10-13 12:26:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:48,243 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-10-13 12:26:48,244 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-10-13 12:26:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:48,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:26:48,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:48,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:48,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:48,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:48,472 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-10-13 12:26:48,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:48,551 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-10-13 12:26:48,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:48,616 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-10-13 12:26:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:48,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:48,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:48,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847041833] [2024-10-13 12:26:48,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847041833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:48,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:48,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:48,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806772727] [2024-10-13 12:26:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:48,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:48,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:48,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:26:48,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 540 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-10-13 12:26:48,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:48,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:26:48,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:50,355 INFO L124 PetriNetUnfolderBase]: 2645/5099 cut-off events. [2024-10-13 12:26:50,356 INFO L125 PetriNetUnfolderBase]: For 8002/8006 co-relation queries the response was YES. [2024-10-13 12:26:50,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13888 conditions, 5099 events. 2645/5099 cut-off events. For 8002/8006 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 36987 event pairs, 1442 based on Foata normal form. 123/5082 useless extension candidates. Maximal degree in co-relation 12430. Up to 3605 conditions per place. [2024-10-13 12:26:50,378 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 127 selfloop transitions, 18 changer transitions 0/174 dead transitions. [2024-10-13 12:26:50,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 174 transitions, 1033 flow [2024-10-13 12:26:50,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:26:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:26:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 326 transitions. [2024-10-13 12:26:50,380 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5258064516129032 [2024-10-13 12:26:50,380 INFO L175 Difference]: Start difference. First operand has 137 places, 124 transitions, 540 flow. Second operand 5 states and 326 transitions. [2024-10-13 12:26:50,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 174 transitions, 1033 flow [2024-10-13 12:26:50,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 174 transitions, 1009 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:26:50,391 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 681 flow [2024-10-13 12:26:50,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=681, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2024-10-13 12:26:50,392 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 21 predicate places. [2024-10-13 12:26:50,392 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 681 flow [2024-10-13 12:26:50,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-10-13 12:26:50,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:50,393 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:50,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-13 12:26:50,593 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-10-13 12:26:50,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:50,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash -2028696617, now seen corresponding path program 1 times [2024-10-13 12:26:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [337804775] [2024-10-13 12:26:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:50,595 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-10-13 12:26:50,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:50,596 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-10-13 12:26:50,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:26:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:50,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 12:26:50,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:50,787 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-10-13 12:26:50,801 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-10-13 12:26:50,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:50,945 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-10-13 12:26:50,958 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:26:50,959 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-10-13 12:26:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:50,984 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:50,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:50,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [337804775] [2024-10-13 12:26:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [337804775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:26:50,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50806256] [2024-10-13 12:26:50,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:50,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:26:50,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:26:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:26:51,305 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:51,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 681 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:51,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:51,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:51,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:52,673 INFO L124 PetriNetUnfolderBase]: 2854/5770 cut-off events. [2024-10-13 12:26:52,673 INFO L125 PetriNetUnfolderBase]: For 10471/10477 co-relation queries the response was YES. [2024-10-13 12:26:52,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17323 conditions, 5770 events. 2854/5770 cut-off events. For 10471/10477 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 44484 event pairs, 709 based on Foata normal form. 39/5685 useless extension candidates. Maximal degree in co-relation 15968. Up to 2466 conditions per place. [2024-10-13 12:26:52,719 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 184 selfloop transitions, 21 changer transitions 0/236 dead transitions. [2024-10-13 12:26:52,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 236 transitions, 1528 flow [2024-10-13 12:26:52,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:26:52,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:26:52,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 559 transitions. [2024-10-13 12:26:52,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5008960573476703 [2024-10-13 12:26:52,723 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 681 flow. Second operand 9 states and 559 transitions. [2024-10-13 12:26:52,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 236 transitions, 1528 flow [2024-10-13 12:26:52,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 236 transitions, 1519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:26:52,756 INFO L231 Difference]: Finished difference. Result has 143 places, 136 transitions, 712 flow [2024-10-13 12:26:52,756 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=712, PETRI_PLACES=143, PETRI_TRANSITIONS=136} [2024-10-13 12:26:52,757 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-10-13 12:26:52,757 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 136 transitions, 712 flow [2024-10-13 12:26:52,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:52,758 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:52,758 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:52,768 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-10-13 12:26:52,958 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-10-13 12:26:52,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:52,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:52,959 INFO L85 PathProgramCache]: Analyzing trace with hash -31356965, now seen corresponding path program 1 times [2024-10-13 12:26:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:52,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291921728] [2024-10-13 12:26:52,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:52,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-10-13 12:26:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:52,963 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-10-13 12:26:52,965 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-10-13 12:26:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:53,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-13 12:26:53,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:53,175 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-10-13 12:26:53,186 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-10-13 12:26:53,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:26:53,348 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-10-13 12:26:53,358 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:26:53,359 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-10-13 12:26:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:53,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:53,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:53,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291921728] [2024-10-13 12:26:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291921728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:53,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 12:26:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992339545] [2024-10-13 12:26:53,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:53,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:26:53,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:53,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:26:53,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:26:53,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:26:53,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 136 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:53,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:53,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:26:53,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:55,236 INFO L124 PetriNetUnfolderBase]: 3265/6509 cut-off events. [2024-10-13 12:26:55,236 INFO L125 PetriNetUnfolderBase]: For 13436/13440 co-relation queries the response was YES. [2024-10-13 12:26:55,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19982 conditions, 6509 events. 3265/6509 cut-off events. For 13436/13440 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 51546 event pairs, 929 based on Foata normal form. 76/6494 useless extension candidates. Maximal degree in co-relation 18617. Up to 2312 conditions per place. [2024-10-13 12:26:55,288 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 202 selfloop transitions, 21 changer transitions 0/254 dead transitions. [2024-10-13 12:26:55,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 254 transitions, 1673 flow [2024-10-13 12:26:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 12:26:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 12:26:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 574 transitions. [2024-10-13 12:26:55,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.514336917562724 [2024-10-13 12:26:55,291 INFO L175 Difference]: Start difference. First operand has 143 places, 136 transitions, 712 flow. Second operand 9 states and 574 transitions. [2024-10-13 12:26:55,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 254 transitions, 1673 flow [2024-10-13 12:26:55,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 254 transitions, 1625 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 12:26:55,329 INFO L231 Difference]: Finished difference. Result has 141 places, 134 transitions, 712 flow [2024-10-13 12:26:55,330 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=712, PETRI_PLACES=141, PETRI_TRANSITIONS=134} [2024-10-13 12:26:55,332 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-10-13 12:26:55,332 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 134 transitions, 712 flow [2024-10-13 12:26:55,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:55,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:55,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:55,343 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-10-13 12:26:55,534 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-10-13 12:26:55,534 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash -57542712, now seen corresponding path program 1 times [2024-10-13 12:26:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250716728] [2024-10-13 12:26:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:55,535 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-10-13 12:26:55,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:55,539 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-10-13 12:26:55,540 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-10-13 12:26:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:55,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:26:55,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:55,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:55,791 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:55,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:26:55,797 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-10-13 12:26:55,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:26:55,906 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-10-13 12:26:55,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:55,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:55,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250716728] [2024-10-13 12:26:55,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250716728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:55,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:55,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:26:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114498326] [2024-10-13 12:26:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:26:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:26:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:26:56,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:26:56,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 134 transitions, 712 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-10-13 12:26:56,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:56,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:26:56,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:57,872 INFO L124 PetriNetUnfolderBase]: 3923/7500 cut-off events. [2024-10-13 12:26:57,872 INFO L125 PetriNetUnfolderBase]: For 20028/20030 co-relation queries the response was YES. [2024-10-13 12:26:57,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24308 conditions, 7500 events. 3923/7500 cut-off events. For 20028/20030 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 58898 event pairs, 2283 based on Foata normal form. 177/7569 useless extension candidates. Maximal degree in co-relation 22297. Up to 5244 conditions per place. [2024-10-13 12:26:57,921 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 131 selfloop transitions, 34 changer transitions 0/194 dead transitions. [2024-10-13 12:26:57,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 194 transitions, 1422 flow [2024-10-13 12:26:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:26:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:26:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 320 transitions. [2024-10-13 12:26:57,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-10-13 12:26:57,923 INFO L175 Difference]: Start difference. First operand has 141 places, 134 transitions, 712 flow. Second operand 5 states and 320 transitions. [2024-10-13 12:26:57,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 194 transitions, 1422 flow [2024-10-13 12:26:57,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 194 transitions, 1377 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 12:26:57,993 INFO L231 Difference]: Finished difference. Result has 142 places, 157 transitions, 1046 flow [2024-10-13 12:26:57,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1046, PETRI_PLACES=142, PETRI_TRANSITIONS=157} [2024-10-13 12:26:57,994 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 24 predicate places. [2024-10-13 12:26:57,995 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 157 transitions, 1046 flow [2024-10-13 12:26:57,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-10-13 12:26:57,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:57,995 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:26:58,007 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-10-13 12:26:58,199 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-10-13 12:26:58,200 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:26:58,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:26:58,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1783923114, now seen corresponding path program 1 times [2024-10-13 12:26:58,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:26:58,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687170784] [2024-10-13 12:26:58,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:26:58,201 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-10-13 12:26:58,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:26:58,205 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-10-13 12:26:58,206 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-10-13 12:26:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:26:58,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:26:58,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:26:58,546 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_89| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89| (_ bv0 1))))) is different from true [2024-10-13 12:26:58,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:26:58,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:26:58,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:26:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687170784] [2024-10-13 12:26:58,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687170784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:26:58,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:26:58,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:26:58,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334527992] [2024-10-13 12:26:58,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:26:58,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:26:58,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:26:58,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:26:58,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-10-13 12:26:58,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 124 [2024-10-13 12:26:58,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 157 transitions, 1046 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:58,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:26:58,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 124 [2024-10-13 12:26:58,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:26:59,850 INFO L124 PetriNetUnfolderBase]: 4100/7683 cut-off events. [2024-10-13 12:26:59,850 INFO L125 PetriNetUnfolderBase]: For 25095/25097 co-relation queries the response was YES. [2024-10-13 12:26:59,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27573 conditions, 7683 events. 4100/7683 cut-off events. For 25095/25097 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 58897 event pairs, 1856 based on Foata normal form. 1/7581 useless extension candidates. Maximal degree in co-relation 25446. Up to 3484 conditions per place. [2024-10-13 12:26:59,893 INFO L140 encePairwiseOnDemand]: 98/124 looper letters, 145 selfloop transitions, 40 changer transitions 4/207 dead transitions. [2024-10-13 12:26:59,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 207 transitions, 1692 flow [2024-10-13 12:26:59,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:26:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:26:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2024-10-13 12:26:59,895 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-10-13 12:26:59,895 INFO L175 Difference]: Start difference. First operand has 142 places, 157 transitions, 1046 flow. Second operand 5 states and 250 transitions. [2024-10-13 12:26:59,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 207 transitions, 1692 flow [2024-10-13 12:26:59,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 207 transitions, 1684 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-10-13 12:26:59,955 INFO L231 Difference]: Finished difference. Result has 149 places, 175 transitions, 1331 flow [2024-10-13 12:26:59,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1331, PETRI_PLACES=149, PETRI_TRANSITIONS=175} [2024-10-13 12:26:59,955 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 31 predicate places. [2024-10-13 12:26:59,956 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 175 transitions, 1331 flow [2024-10-13 12:26:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:26:59,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:26:59,956 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-10-13 12:26:59,964 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-10-13 12:27:00,156 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-10-13 12:27:00,157 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:00,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:00,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1685960310, now seen corresponding path program 1 times [2024-10-13 12:27:00,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:00,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1988110268] [2024-10-13 12:27:00,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:00,158 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-10-13 12:27:00,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:00,159 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-10-13 12:27:00,160 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-10-13 12:27:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:00,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:27:00,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:00,344 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-10-13 12:27:00,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:00,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:00,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:00,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1988110268] [2024-10-13 12:27:00,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1988110268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:00,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:00,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:27:00,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362759374] [2024-10-13 12:27:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:00,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:27:00,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:00,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:27:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:27:00,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:27:00,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 175 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:00,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:00,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:27:00,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:01,450 INFO L124 PetriNetUnfolderBase]: 3865/7293 cut-off events. [2024-10-13 12:27:01,450 INFO L125 PetriNetUnfolderBase]: For 32080/32168 co-relation queries the response was YES. [2024-10-13 12:27:01,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30706 conditions, 7293 events. 3865/7293 cut-off events. For 32080/32168 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 55633 event pairs, 2239 based on Foata normal form. 22/7140 useless extension candidates. Maximal degree in co-relation 28463. Up to 6028 conditions per place. [2024-10-13 12:27:01,491 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 151 selfloop transitions, 5 changer transitions 0/185 dead transitions. [2024-10-13 12:27:01,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 185 transitions, 1719 flow [2024-10-13 12:27:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:27:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:27:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2024-10-13 12:27:01,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-10-13 12:27:01,493 INFO L175 Difference]: Start difference. First operand has 149 places, 175 transitions, 1331 flow. Second operand 3 states and 201 transitions. [2024-10-13 12:27:01,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 185 transitions, 1719 flow [2024-10-13 12:27:01,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 185 transitions, 1635 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-10-13 12:27:01,598 INFO L231 Difference]: Finished difference. Result has 145 places, 173 transitions, 1253 flow [2024-10-13 12:27:01,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=143, 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=1253, PETRI_PLACES=145, PETRI_TRANSITIONS=173} [2024-10-13 12:27:01,599 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-10-13 12:27:01,600 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 173 transitions, 1253 flow [2024-10-13 12:27:01,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:01,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:01,600 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-10-13 12:27:01,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-13 12:27:01,801 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-10-13 12:27:01,801 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:01,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:01,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1685960309, now seen corresponding path program 1 times [2024-10-13 12:27:01,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:01,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556330135] [2024-10-13 12:27:01,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:01,802 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-10-13 12:27:01,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:01,803 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-10-13 12:27:01,804 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-10-13 12:27:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:01,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:27:01,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:01,967 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-10-13 12:27:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:01,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:01,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556330135] [2024-10-13 12:27:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556330135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:01,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:01,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:27:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435588483] [2024-10-13 12:27:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:01,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:27:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:01,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:27:01,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:27:02,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-10-13 12:27:02,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 173 transitions, 1253 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:02,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:02,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-10-13 12:27:02,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:03,034 INFO L124 PetriNetUnfolderBase]: 3865/7284 cut-off events. [2024-10-13 12:27:03,034 INFO L125 PetriNetUnfolderBase]: For 29520/29608 co-relation queries the response was YES. [2024-10-13 12:27:03,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30327 conditions, 7284 events. 3865/7284 cut-off events. For 29520/29608 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 55426 event pairs, 2239 based on Foata normal form. 22/7131 useless extension candidates. Maximal degree in co-relation 28742. Up to 6028 conditions per place. [2024-10-13 12:27:03,079 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 151 selfloop transitions, 5 changer transitions 0/183 dead transitions. [2024-10-13 12:27:03,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 183 transitions, 1641 flow [2024-10-13 12:27:03,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:27:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:27:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2024-10-13 12:27:03,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-10-13 12:27:03,080 INFO L175 Difference]: Start difference. First operand has 145 places, 173 transitions, 1253 flow. Second operand 3 states and 201 transitions. [2024-10-13 12:27:03,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 183 transitions, 1641 flow [2024-10-13 12:27:03,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 183 transitions, 1631 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:27:03,160 INFO L231 Difference]: Finished difference. Result has 143 places, 171 transitions, 1249 flow [2024-10-13 12:27:03,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1249, PETRI_PLACES=143, PETRI_TRANSITIONS=171} [2024-10-13 12:27:03,161 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-10-13 12:27:03,161 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 171 transitions, 1249 flow [2024-10-13 12:27:03,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:03,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:03,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:03,167 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-10-13 12:27:03,361 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-10-13 12:27:03,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:03,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:03,362 INFO L85 PathProgramCache]: Analyzing trace with hash 725162667, now seen corresponding path program 1 times [2024-10-13 12:27:03,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:03,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185785630] [2024-10-13 12:27:03,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:03,363 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-10-13 12:27:03,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:03,365 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-10-13 12:27:03,366 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-10-13 12:27:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:03,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:27:03,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:03,626 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-10-13 12:27:03,695 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 12:27:03,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 12:27:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:03,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:03,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:03,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185785630] [2024-10-13 12:27:03,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185785630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:03,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:03,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:27:03,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948018065] [2024-10-13 12:27:03,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:03,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:27:03,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:03,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:27:03,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:27:04,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-10-13 12:27:04,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 171 transitions, 1249 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:04,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:04,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-10-13 12:27:04,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:05,744 INFO L124 PetriNetUnfolderBase]: 4065/7614 cut-off events. [2024-10-13 12:27:05,744 INFO L125 PetriNetUnfolderBase]: For 29380/29406 co-relation queries the response was YES. [2024-10-13 12:27:05,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31360 conditions, 7614 events. 4065/7614 cut-off events. For 29380/29406 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 57519 event pairs, 2176 based on Foata normal form. 9/7561 useless extension candidates. Maximal degree in co-relation 29956. Up to 3487 conditions per place. [2024-10-13 12:27:05,804 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 144 selfloop transitions, 21 changer transitions 0/189 dead transitions. [2024-10-13 12:27:05,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 189 transitions, 1707 flow [2024-10-13 12:27:05,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:27:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:27:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2024-10-13 12:27:05,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46975806451612906 [2024-10-13 12:27:05,806 INFO L175 Difference]: Start difference. First operand has 143 places, 171 transitions, 1249 flow. Second operand 4 states and 233 transitions. [2024-10-13 12:27:05,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 189 transitions, 1707 flow [2024-10-13 12:27:05,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 189 transitions, 1697 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:27:05,919 INFO L231 Difference]: Finished difference. Result has 140 places, 167 transitions, 1273 flow [2024-10-13 12:27:05,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1273, PETRI_PLACES=140, PETRI_TRANSITIONS=167} [2024-10-13 12:27:05,920 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-10-13 12:27:05,920 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 167 transitions, 1273 flow [2024-10-13 12:27:05,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:05,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:05,920 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:05,931 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-10-13 12:27:06,121 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-10-13 12:27:06,121 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:06,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:06,121 INFO L85 PathProgramCache]: Analyzing trace with hash 725162668, now seen corresponding path program 1 times [2024-10-13 12:27:06,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:06,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947895966] [2024-10-13 12:27:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:06,122 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-10-13 12:27:06,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:06,124 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-10-13 12:27:06,125 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-10-13 12:27:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:06,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:27:06,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:06,426 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-10-13 12:27:06,432 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-10-13 12:27:06,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:06,591 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-10-13 12:27:06,606 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:27:06,606 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-10-13 12:27:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:06,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:06,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:06,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947895966] [2024-10-13 12:27:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947895966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:06,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:27:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410942932] [2024-10-13 12:27:06,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:06,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:27:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:06,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:27:06,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:27:06,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 124 [2024-10-13 12:27:06,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 167 transitions, 1273 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:06,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:06,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 124 [2024-10-13 12:27:06,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:08,012 INFO L124 PetriNetUnfolderBase]: 3809/7173 cut-off events. [2024-10-13 12:27:08,012 INFO L125 PetriNetUnfolderBase]: For 31542/31630 co-relation queries the response was YES. [2024-10-13 12:27:08,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30207 conditions, 7173 events. 3809/7173 cut-off events. For 31542/31630 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 54810 event pairs, 1990 based on Foata normal form. 21/7082 useless extension candidates. Maximal degree in co-relation 27909. Up to 3203 conditions per place. [2024-10-13 12:27:08,066 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 150 selfloop transitions, 19 changer transitions 0/189 dead transitions. [2024-10-13 12:27:08,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 189 transitions, 1759 flow [2024-10-13 12:27:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:27:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:27:08,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2024-10-13 12:27:08,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4475806451612903 [2024-10-13 12:27:08,068 INFO L175 Difference]: Start difference. First operand has 140 places, 167 transitions, 1273 flow. Second operand 4 states and 222 transitions. [2024-10-13 12:27:08,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 189 transitions, 1759 flow [2024-10-13 12:27:08,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 189 transitions, 1717 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:27:08,172 INFO L231 Difference]: Finished difference. Result has 136 places, 163 transitions, 1261 flow [2024-10-13 12:27:08,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1261, PETRI_PLACES=136, PETRI_TRANSITIONS=163} [2024-10-13 12:27:08,173 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 18 predicate places. [2024-10-13 12:27:08,173 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 163 transitions, 1261 flow [2024-10-13 12:27:08,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:08,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:08,174 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:08,182 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-10-13 12:27:08,374 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-10-13 12:27:08,374 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:08,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1549238885, now seen corresponding path program 1 times [2024-10-13 12:27:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:08,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552673592] [2024-10-13 12:27:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:08,376 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-10-13 12:27:08,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:08,379 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-10-13 12:27:08,381 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-10-13 12:27:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:08,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:27:08,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:08,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:08,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:08,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:08,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552673592] [2024-10-13 12:27:08,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552673592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:08,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:08,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 12:27:08,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168247698] [2024-10-13 12:27:08,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:08,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:27:08,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:27:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:27:08,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-10-13 12:27:08,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 163 transitions, 1261 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:08,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:08,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-10-13 12:27:08,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:08,939 INFO L124 PetriNetUnfolderBase]: 455/834 cut-off events. [2024-10-13 12:27:08,939 INFO L125 PetriNetUnfolderBase]: For 2985/2985 co-relation queries the response was YES. [2024-10-13 12:27:08,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 834 events. 455/834 cut-off events. For 2985/2985 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3388 event pairs, 63 based on Foata normal form. 64/879 useless extension candidates. Maximal degree in co-relation 3361. Up to 484 conditions per place. [2024-10-13 12:27:08,944 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 75 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-10-13 12:27:08,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 103 transitions, 697 flow [2024-10-13 12:27:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:27:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:27:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2024-10-13 12:27:08,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2024-10-13 12:27:08,946 INFO L175 Difference]: Start difference. First operand has 136 places, 163 transitions, 1261 flow. Second operand 4 states and 242 transitions. [2024-10-13 12:27:08,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 103 transitions, 697 flow [2024-10-13 12:27:08,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 103 transitions, 506 flow, removed 49 selfloop flow, removed 28 redundant places. [2024-10-13 12:27:08,957 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 246 flow [2024-10-13 12:27:08,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2024-10-13 12:27:08,958 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -27 predicate places. [2024-10-13 12:27:08,958 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 246 flow [2024-10-13 12:27:08,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:08,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:08,958 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-10-13 12:27:08,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-10-13 12:27:09,159 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-10-13 12:27:09,159 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:09,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:09,159 INFO L85 PathProgramCache]: Analyzing trace with hash -460667373, now seen corresponding path program 1 times [2024-10-13 12:27:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086614149] [2024-10-13 12:27:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:09,160 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-10-13 12:27:09,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:09,162 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-10-13 12:27:09,163 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-10-13 12:27:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:09,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:27:09,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:09,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:09,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:09,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:09,607 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:27:09,608 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:27:09,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-10-13 12:27:09,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:27:09,645 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-10-13 12:27:09,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:09,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:09,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:09,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086614149] [2024-10-13 12:27:09,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086614149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:09,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:09,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:27:09,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997306215] [2024-10-13 12:27:09,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:09,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:27:09,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:09,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:27:09,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:27:09,738 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-10-13 12:27:09,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:09,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:09,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-10-13 12:27:09,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:10,071 INFO L124 PetriNetUnfolderBase]: 468/874 cut-off events. [2024-10-13 12:27:10,072 INFO L125 PetriNetUnfolderBase]: For 948/948 co-relation queries the response was YES. [2024-10-13 12:27:10,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 874 events. 468/874 cut-off events. For 948/948 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3407 event pairs, 382 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 2586. Up to 777 conditions per place. [2024-10-13 12:27:10,075 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 66 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-10-13 12:27:10,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 90 transitions, 433 flow [2024-10-13 12:27:10,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:27:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:27:10,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2024-10-13 12:27:10,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2024-10-13 12:27:10,077 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 246 flow. Second operand 3 states and 182 transitions. [2024-10-13 12:27:10,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 90 transitions, 433 flow [2024-10-13 12:27:10,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 421 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:27:10,079 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 282 flow [2024-10-13 12:27:10,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2024-10-13 12:27:10,080 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -26 predicate places. [2024-10-13 12:27:10,080 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 282 flow [2024-10-13 12:27:10,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:10,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:10,080 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:10,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-10-13 12:27:10,281 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-10-13 12:27:10,281 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:10,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:10,281 INFO L85 PathProgramCache]: Analyzing trace with hash 761685876, now seen corresponding path program 1 times [2024-10-13 12:27:10,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:10,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181311135] [2024-10-13 12:27:10,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:10,282 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:27:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:10,284 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-10-13 12:27:10,284 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-10-13 12:27:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:10,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:27:10,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:10,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:10,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:10,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:27:10,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:27:10,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 12:27:10,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-10-13 12:27:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:10,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:10,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:10,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181311135] [2024-10-13 12:27:10,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181311135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:10,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:10,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:27:10,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992795757] [2024-10-13 12:27:10,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:10,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:27:10,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:10,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:27:10,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:27:10,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-10-13 12:27:10,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:10,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:10,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-10-13 12:27:10,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:11,136 INFO L124 PetriNetUnfolderBase]: 477/901 cut-off events. [2024-10-13 12:27:11,136 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-10-13 12:27:11,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 901 events. 477/901 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3541 event pairs, 395 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2680. Up to 800 conditions per place. [2024-10-13 12:27:11,140 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 68 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-10-13 12:27:11,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 499 flow [2024-10-13 12:27:11,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:27:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:27:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-10-13 12:27:11,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2024-10-13 12:27:11,142 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 282 flow. Second operand 3 states and 181 transitions. [2024-10-13 12:27:11,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 499 flow [2024-10-13 12:27:11,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 94 transitions, 467 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-10-13 12:27:11,145 INFO L231 Difference]: Finished difference. Result has 94 places, 86 transitions, 328 flow [2024-10-13 12:27:11,145 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=94, PETRI_TRANSITIONS=86} [2024-10-13 12:27:11,146 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -24 predicate places. [2024-10-13 12:27:11,146 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 86 transitions, 328 flow [2024-10-13 12:27:11,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:11,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:11,146 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-10-13 12:27:11,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-10-13 12:27:11,346 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-10-13 12:27:11,347 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:11,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:11,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1555199645, now seen corresponding path program 1 times [2024-10-13 12:27:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:11,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [131983427] [2024-10-13 12:27:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:27:11,348 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-10-13 12:27:11,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:11,350 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-10-13 12:27:11,351 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-10-13 12:27:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:27:11,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 12:27:11,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:11,716 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-10-13 12:27:11,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:27:11,773 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:11,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:11,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [131983427] [2024-10-13 12:27:11,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [131983427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:11,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:11,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:27:11,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714731360] [2024-10-13 12:27:11,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:11,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:27:11,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:11,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:27:11,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:27:11,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:27:11,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 86 transitions, 328 flow. Second operand has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:11,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:11,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:27:11,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:12,507 INFO L124 PetriNetUnfolderBase]: 541/1023 cut-off events. [2024-10-13 12:27:12,507 INFO L125 PetriNetUnfolderBase]: For 1284/1284 co-relation queries the response was YES. [2024-10-13 12:27:12,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3119 conditions, 1023 events. 541/1023 cut-off events. For 1284/1284 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4501 event pairs, 48 based on Foata normal form. 16/1028 useless extension candidates. Maximal degree in co-relation 3105. Up to 562 conditions per place. [2024-10-13 12:27:12,512 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 105 selfloop transitions, 22 changer transitions 0/149 dead transitions. [2024-10-13 12:27:12,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 149 transitions, 861 flow [2024-10-13 12:27:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:27:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:27:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 541 transitions. [2024-10-13 12:27:12,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43629032258064515 [2024-10-13 12:27:12,514 INFO L175 Difference]: Start difference. First operand has 94 places, 86 transitions, 328 flow. Second operand 10 states and 541 transitions. [2024-10-13 12:27:12,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 149 transitions, 861 flow [2024-10-13 12:27:12,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 149 transitions, 843 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-10-13 12:27:12,520 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 474 flow [2024-10-13 12:27:12,521 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=474, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-10-13 12:27:12,521 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -11 predicate places. [2024-10-13 12:27:12,521 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 474 flow [2024-10-13 12:27:12,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:12,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:12,522 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-10-13 12:27:12,535 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-10-13 12:27:12,722 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-10-13 12:27:12,723 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -660361977, now seen corresponding path program 2 times [2024-10-13 12:27:12,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:12,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192486835] [2024-10-13 12:27:12,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:27:12,724 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-10-13 12:27:12,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:12,726 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-10-13 12:27:12,727 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-10-13 12:27:13,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 12:27:13,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:27:13,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-13 12:27:13,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:27:13,120 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-10-13 12:27:13,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-10-13 12:27:13,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:27:13,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:27:13,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192486835] [2024-10-13 12:27:13,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192486835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:27:13,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:27:13,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:27:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582202077] [2024-10-13 12:27:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:27:13,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 12:27:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:27:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 12:27:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 12:27:13,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-10-13 12:27:13,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 474 flow. Second operand has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:13,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:27:13,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-10-13 12:27:13,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:27:14,294 INFO L124 PetriNetUnfolderBase]: 644/1233 cut-off events. [2024-10-13 12:27:14,294 INFO L125 PetriNetUnfolderBase]: For 2409/2409 co-relation queries the response was YES. [2024-10-13 12:27:14,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1233 events. 644/1233 cut-off events. For 2409/2409 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 5823 event pairs, 35 based on Foata normal form. 16/1216 useless extension candidates. Maximal degree in co-relation 4295. Up to 421 conditions per place. [2024-10-13 12:27:14,303 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 140 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2024-10-13 12:27:14,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 196 transitions, 1317 flow [2024-10-13 12:27:14,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:27:14,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:27:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 651 transitions. [2024-10-13 12:27:14,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-10-13 12:27:14,308 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 474 flow. Second operand 12 states and 651 transitions. [2024-10-13 12:27:14,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 196 transitions, 1317 flow [2024-10-13 12:27:14,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 196 transitions, 1286 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-13 12:27:14,318 INFO L231 Difference]: Finished difference. Result has 119 places, 117 transitions, 656 flow [2024-10-13 12:27:14,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=656, PETRI_PLACES=119, PETRI_TRANSITIONS=117} [2024-10-13 12:27:14,319 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 1 predicate places. [2024-10-13 12:27:14,319 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 117 transitions, 656 flow [2024-10-13 12:27:14,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:27:14,319 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:27:14,319 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-10-13 12:27:14,331 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 (24)] Forceful destruction successful, exit code 0 [2024-10-13 12:27:14,520 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-10-13 12:27:14,520 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-13 12:27:14,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:27:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1135150381, now seen corresponding path program 3 times [2024-10-13 12:27:14,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:27:14,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344018165] [2024-10-13 12:27:14,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:27:14,522 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-10-13 12:27:14,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:27:14,523 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-10-13 12:27:14,524 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-10-13 12:27:14,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-13 12:27:14,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-13 12:27:14,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:27:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:27:15,118 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:27:15,118 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:27:15,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-10-13 12:27:15,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-10-13 12:27:15,121 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-10-13 12:27:15,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-10-13 12:27:15,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-10-13 12:27:15,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-10-13 12:27:15,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-10-13 12:27:15,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-10-13 12:27:15,122 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-10-13 12:27:15,123 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-10-13 12:27:15,124 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (32 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-10-13 12:27:15,125 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-13 12:27:15,126 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-10-13 12:27:15,127 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-10-13 12:27:15,128 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-10-13 12:27:15,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-10-13 12:27:15,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-10-13 12:27:15,129 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-10-13 12:27:15,145 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-10-13 12:27:15,329 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-10-13 12:27:15,331 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:27:15,394 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:27:15,395 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:27:15,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:27:15 BasicIcfg [2024-10-13 12:27:15,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:27:15,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:27:15,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:27:15,402 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:27:15,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:26:31" (3/4) ... [2024-10-13 12:27:15,404 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:27:15,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:27:15,406 INFO L158 Benchmark]: Toolchain (without parser) took 46789.76ms. Allocated memory was 77.6MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 45.5MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. [2024-10-13 12:27:15,406 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:27:15,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 914.53ms. Allocated memory is still 77.6MB. Free memory was 45.4MB in the beginning and 41.0MB in the end (delta: 4.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-10-13 12:27:15,406 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.38ms. Allocated memory is still 77.6MB. Free memory was 41.0MB in the beginning and 37.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:27:15,406 INFO L158 Benchmark]: Boogie Preprocessor took 128.05ms. Allocated memory is still 77.6MB. Free memory was 37.8MB in the beginning and 32.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:27:15,407 INFO L158 Benchmark]: RCFGBuilder took 1353.29ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 32.8MB in the beginning and 64.1MB in the end (delta: -31.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-13 12:27:15,407 INFO L158 Benchmark]: TraceAbstraction took 44283.97ms. Allocated memory was 94.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 63.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 281.5MB. Max. memory is 16.1GB. [2024-10-13 12:27:15,407 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:27:15,410 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 58.7MB. Free memory was 30.5MB in the beginning and 30.4MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 914.53ms. Allocated memory is still 77.6MB. Free memory was 45.4MB in the beginning and 41.0MB in the end (delta: 4.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.38ms. Allocated memory is still 77.6MB. Free memory was 41.0MB in the beginning and 37.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.05ms. Allocated memory is still 77.6MB. Free memory was 37.8MB in the beginning and 32.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1353.29ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 32.8MB in the beginning and 64.1MB in the end (delta: -31.4MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44283.97ms. Allocated memory was 94.4MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 63.4MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 281.5MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, d={3:24}, data={3:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3907] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result=0, \result={0:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3941] 0 data->shared.a = 3 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3907] 2 data->shared.a = 1 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3944] 0 data->shared.b = 3 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_5-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_5-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 131 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 44.1s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2947 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2421 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 12.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 143 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6377 IncrementalHoareTripleChecker+Invalid, 6627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 119 mSDtfsCounter, 6377 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 378 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1331occurred in iteration=14, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 341 ConstructedInterpolants, 5 QuantifiedInterpolants, 2323 SizeOfPredicates, 142 NumberOfNonLiveVariables, 3335 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:27:15,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample