./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_3-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:42:14,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:42:14,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:42:14,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:42:14,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:42:14,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:42:14,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:42:14,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:42:14,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:42:14,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:42:14,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:42:14,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:42:14,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:42:14,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:42:14,587 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:42:14,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:42:14,588 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:42:14,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:42:14,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:42:14,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:42:14,589 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:42:14,592 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:42:14,592 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:42:14,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:42:14,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:42:14,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:42:14,595 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:42:14,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:42:14,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:42:14,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:42:14,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:42:14,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:42:14,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:42:14,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:42:14,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:42:14,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:42:14,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:42:14,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:42:14,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:42:14,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:42:14,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:42:14,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:42:14,598 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-clean/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-clean/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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-10-11 19:42:14,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:42:14,837 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:42:14,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:42:14,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:42:14,841 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:42:14,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-11 19:42:16,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:42:16,259 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:42:16,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-11 19:42:16,285 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e3a40a3f/aa55df8d28fb4ce0a40e88f1399aaa02/FLAG975483c2c [2024-10-11 19:42:16,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e3a40a3f/aa55df8d28fb4ce0a40e88f1399aaa02 [2024-10-11 19:42:16,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:42:16,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:42:16,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:16,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:42:16,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:42:16,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63116b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:16, skipping insertion in model container [2024-10-11 19:42:16,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:16" (1/1) ... [2024-10-11 19:42:16,649 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:42:17,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:17,045 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-11 19:42:17,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3b427c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:17, skipping insertion in model container [2024-10-11 19:42:17,046 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:17,046 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-11 19:42:17,048 INFO L158 Benchmark]: Toolchain (without parser) took 450.77ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 100.9MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 19:42:17,048 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:42:17,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.11ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 100.9MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-11 19:42:17,050 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.13ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.11ms. Allocated memory is still 161.5MB. Free memory was 123.7MB in the beginning and 100.9MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. 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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:42:18,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:42:18,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:42:18,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:42:18,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:42:18,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:42:18,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:42:18,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:42:18,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:42:18,702 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:42:18,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:42:18,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:42:18,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:42:18,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:42:18,705 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:42:18,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:42:18,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:42:18,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:42:18,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:42:18,709 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:42:18,709 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:42:18,709 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:42:18,710 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:42:18,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:42:18,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:42:18,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:42:18,710 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:42:18,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:42:18,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:42:18,711 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:42:18,711 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:42:18,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:42:18,711 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:42:18,712 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:42:18,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:42:18,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:42:18,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:42:18,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:42:18,712 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:42:18,713 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:42:18,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:42:18,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:42:18,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:42:18,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:42:18,714 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:42:18,714 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-clean/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-clean/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 -> 11cd6df53312b6388eb67fa3ddad4ddfe9675663ccf0a1507d8b60fd9abceccc [2024-10-11 19:42:18,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:42:18,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:42:19,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:42:19,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:42:19,003 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:42:19,005 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-11 19:42:20,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:42:20,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:42:20,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_3-container_of.i [2024-10-11 19:42:20,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1714358af/05da525a136f4923bd13ebbedcc3e982/FLAG407f1f400 [2024-10-11 19:42:20,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1714358af/05da525a136f4923bd13ebbedcc3e982 [2024-10-11 19:42:20,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:42:20,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:42:20,585 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:20,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:42:20,590 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:42:20,590 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:20" (1/1) ... [2024-10-11 19:42:20,591 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f445ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:20, skipping insertion in model container [2024-10-11 19:42:20,591 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:42:20" (1/1) ... [2024-10-11 19:42:20,690 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:42:21,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:21,055 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-11 19:42:21,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:42:21,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:21,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:42:21,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:42:21,207 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:42:21,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21 WrapperNode [2024-10-11 19:42:21,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:42:21,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:42:21,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:42:21,209 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:42:21,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,255 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-10-11 19:42:21,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:42:21,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:42:21,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:42:21,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:42:21,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,288 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-11 19:42:21,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:42:21,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:42:21,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:42:21,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:42:21,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (1/1) ... [2024-10-11 19:42:21,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:42:21,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:42:21,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:42:21,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:42:21,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-10-11 19:42:21,408 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:42:21,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:42:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 19:42:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 19:42:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 19:42:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:42:21,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:42:21,411 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:42:21,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:42:21,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:42:22,069 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:42:22,069 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:42:22,209 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:42:22,210 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:42:22,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:42:22 BoogieIcfgContainer [2024-10-11 19:42:22,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:42:22,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:42:22,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:42:22,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:42:22,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:42:20" (1/3) ... [2024-10-11 19:42:22,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5917feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:42:22, skipping insertion in model container [2024-10-11 19:42:22,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:42:21" (2/3) ... [2024-10-11 19:42:22,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5917feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:42:22, skipping insertion in model container [2024-10-11 19:42:22,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:42:22" (3/3) ... [2024-10-11 19:42:22,217 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2024-10-11 19:42:22,228 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:42:22,228 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-10-11 19:42:22,229 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:42:22,291 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 19:42:22,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 125 transitions, 264 flow [2024-10-11 19:42:22,366 INFO L124 PetriNetUnfolderBase]: 14/158 cut-off events. [2024-10-11 19:42:22,367 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 19:42:22,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 158 events. 14/158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 534 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. [2024-10-11 19:42:22,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 125 transitions, 264 flow [2024-10-11 19:42:22,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 123 transitions, 258 flow [2024-10-11 19:42:22,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:42:22,386 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;@5b8d8aaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:42:22,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-11 19:42:22,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:42:22,388 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-11 19:42:22,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:42:22,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:22,389 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:42:22,389 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-11 19:42:22,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 557403, now seen corresponding path program 1 times [2024-10-11 19:42:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282941279] [2024-10-11 19:42:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:22,404 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-11 19:42:22,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:22,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:22,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:22,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:42:22,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:22,570 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-11 19:42:22,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:22,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:22,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:22,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282941279] [2024-10-11 19:42:22,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [282941279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:22,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:22,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693618653] [2024-10-11 19:42:22,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:22,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:22,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-10-11 19:42:22,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 123 transitions, 258 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-11 19:42:22,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:22,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-10-11 19:42:22,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:24,341 INFO L124 PetriNetUnfolderBase]: 7867/16174 cut-off events. [2024-10-11 19:42:24,342 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-11 19:42:24,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28480 conditions, 16174 events. 7867/16174 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 575. Compared 148472 event pairs, 4199 based on Foata normal form. 792/10803 useless extension candidates. Maximal degree in co-relation 28239. Up to 6584 conditions per place. [2024-10-11 19:42:24,431 INFO L140 encePairwiseOnDemand]: 109/125 looper letters, 90 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-10-11 19:42:24,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 131 transitions, 458 flow [2024-10-11 19:42:24,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:24,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 229 transitions. [2024-10-11 19:42:24,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6106666666666667 [2024-10-11 19:42:24,444 INFO L175 Difference]: Start difference. First operand has 119 places, 123 transitions, 258 flow. Second operand 3 states and 229 transitions. [2024-10-11 19:42:24,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 131 transitions, 458 flow [2024-10-11 19:42:24,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 131 transitions, 450 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 19:42:24,452 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 218 flow [2024-10-11 19:42:24,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=107, PETRI_TRANSITIONS=105} [2024-10-11 19:42:24,457 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -12 predicate places. [2024-10-11 19:42:24,457 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 218 flow [2024-10-11 19:42:24,458 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-11 19:42:24,458 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:24,458 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-11 19:42:24,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 19:42:24,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:24,662 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-11 19:42:24,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 557404, now seen corresponding path program 1 times [2024-10-11 19:42:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:24,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485840790] [2024-10-11 19:42:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:24,665 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-11 19:42:24,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:24,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:24,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:24,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:42:24,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:24,774 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-11 19:42:24,781 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-11 19:42:24,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:24,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485840790] [2024-10-11 19:42:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485840790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:24,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984895753] [2024-10-11 19:42:24,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:24,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:24,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:24,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:24,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:24,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-10-11 19:42:24,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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-11 19:42:24,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:24,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-10-11 19:42:24,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:26,051 INFO L124 PetriNetUnfolderBase]: 6411/13932 cut-off events. [2024-10-11 19:42:26,051 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-10-11 19:42:26,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24164 conditions, 13932 events. 6411/13932 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 132185 event pairs, 2743 based on Foata normal form. 1/9232 useless extension candidates. Maximal degree in co-relation 8831. Up to 5674 conditions per place. [2024-10-11 19:42:26,104 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 85 selfloop transitions, 2 changer transitions 0/125 dead transitions. [2024-10-11 19:42:26,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 125 transitions, 432 flow [2024-10-11 19:42:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2024-10-11 19:42:26,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.584 [2024-10-11 19:42:26,107 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 218 flow. Second operand 3 states and 219 transitions. [2024-10-11 19:42:26,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 125 transitions, 432 flow [2024-10-11 19:42:26,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 125 transitions, 428 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:26,121 INFO L231 Difference]: Finished difference. Result has 101 places, 99 transitions, 206 flow [2024-10-11 19:42:26,121 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=101, PETRI_TRANSITIONS=99} [2024-10-11 19:42:26,121 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -18 predicate places. [2024-10-11 19:42:26,122 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 99 transitions, 206 flow [2024-10-11 19:42:26,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 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-11 19:42:26,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:26,123 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:42:26,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:26,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:26,324 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-11 19:42:26,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:26,324 INFO L85 PathProgramCache]: Analyzing trace with hash 17277970, now seen corresponding path program 1 times [2024-10-11 19:42:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:26,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211898035] [2024-10-11 19:42:26,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:26,325 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-11 19:42:26,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:26,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:26,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:26,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:42:26,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:26,409 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-11 19:42:26,409 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:26,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211898035] [2024-10-11 19:42:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211898035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:26,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475920856] [2024-10-11 19:42:26,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:26,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:26,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:26,411 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 125 [2024-10-11 19:42:26,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 99 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-11 19:42:26,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:26,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 125 [2024-10-11 19:42:26,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:27,427 INFO L124 PetriNetUnfolderBase]: 6410/12532 cut-off events. [2024-10-11 19:42:27,427 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2024-10-11 19:42:27,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22764 conditions, 12532 events. 6410/12532 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 107472 event pairs, 6045 based on Foata normal form. 1/8162 useless extension candidates. Maximal degree in co-relation 8831. Up to 9455 conditions per place. [2024-10-11 19:42:27,489 INFO L140 encePairwiseOnDemand]: 122/125 looper letters, 85 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-10-11 19:42:27,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 124 transitions, 430 flow [2024-10-11 19:42:27,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:27,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 217 transitions. [2024-10-11 19:42:27,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5786666666666667 [2024-10-11 19:42:27,493 INFO L175 Difference]: Start difference. First operand has 101 places, 99 transitions, 206 flow. Second operand 3 states and 217 transitions. [2024-10-11 19:42:27,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 124 transitions, 430 flow [2024-10-11 19:42:27,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 124 transitions, 426 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:27,499 INFO L231 Difference]: Finished difference. Result has 101 places, 98 transitions, 204 flow [2024-10-11 19:42:27,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=101, PETRI_TRANSITIONS=98} [2024-10-11 19:42:27,502 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -18 predicate places. [2024-10-11 19:42:27,502 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 98 transitions, 204 flow [2024-10-11 19:42:27,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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-11 19:42:27,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:27,503 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:27,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:27,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:27,710 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-11 19:42:27,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1608668968, now seen corresponding path program 1 times [2024-10-11 19:42:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028624968] [2024-10-11 19:42:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:27,711 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-11 19:42:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:27,713 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:27,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:27,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:42:27,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:27,808 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-11 19:42:27,823 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-11 19:42:27,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:27,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028624968] [2024-10-11 19:42:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028624968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:27,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:27,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:27,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183574562] [2024-10-11 19:42:27,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:27,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:27,868 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 125 [2024-10-11 19:42:27,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 98 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-11 19:42:27,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:27,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 125 [2024-10-11 19:42:27,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:28,834 INFO L124 PetriNetUnfolderBase]: 7138/13103 cut-off events. [2024-10-11 19:42:28,834 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-10-11 19:42:28,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24458 conditions, 13103 events. 7138/13103 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 105252 event pairs, 6409 based on Foata normal form. 0/9201 useless extension candidates. Maximal degree in co-relation 23133. Up to 10014 conditions per place. [2024-10-11 19:42:28,890 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 86 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2024-10-11 19:42:28,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 119 transitions, 426 flow [2024-10-11 19:42:28,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:28,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2024-10-11 19:42:28,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5413333333333333 [2024-10-11 19:42:28,892 INFO L175 Difference]: Start difference. First operand has 101 places, 98 transitions, 204 flow. Second operand 3 states and 203 transitions. [2024-10-11 19:42:28,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 119 transitions, 426 flow [2024-10-11 19:42:28,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 119 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:28,899 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 198 flow [2024-10-11 19:42:28,900 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2024-10-11 19:42:28,901 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -23 predicate places. [2024-10-11 19:42:28,902 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 198 flow [2024-10-11 19:42:28,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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-11 19:42:28,902 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:28,902 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:28,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:29,103 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-11 19:42:29,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1608668967, now seen corresponding path program 1 times [2024-10-11 19:42:29,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:29,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572869873] [2024-10-11 19:42:29,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:29,104 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-11 19:42:29,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:29,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:29,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:29,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:42:29,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:29,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 19:42:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:42:29,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:29,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572869873] [2024-10-11 19:42:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1572869873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:29,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:29,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:29,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607022042] [2024-10-11 19:42:29,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:29,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:29,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:29,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:29,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:29,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 125 [2024-10-11 19:42:29,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-11 19:42:29,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:29,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 125 [2024-10-11 19:42:29,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:30,129 INFO L124 PetriNetUnfolderBase]: 6410/11764 cut-off events. [2024-10-11 19:42:30,129 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-10-11 19:42:30,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22012 conditions, 11764 events. 6410/11764 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 92345 event pairs, 5291 based on Foata normal form. 394/8542 useless extension candidates. Maximal degree in co-relation 19111. Up to 8270 conditions per place. [2024-10-11 19:42:30,171 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 97 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2024-10-11 19:42:30,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 126 transitions, 466 flow [2024-10-11 19:42:30,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:30,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-10-11 19:42:30,173 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5813333333333334 [2024-10-11 19:42:30,173 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 198 flow. Second operand 3 states and 218 transitions. [2024-10-11 19:42:30,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 126 transitions, 466 flow [2024-10-11 19:42:30,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 126 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:30,180 INFO L231 Difference]: Finished difference. Result has 97 places, 94 transitions, 211 flow [2024-10-11 19:42:30,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=97, PETRI_TRANSITIONS=94} [2024-10-11 19:42:30,182 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -22 predicate places. [2024-10-11 19:42:30,182 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 94 transitions, 211 flow [2024-10-11 19:42:30,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-11 19:42:30,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:30,183 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:30,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:30,387 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-11 19:42:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1751356453, now seen corresponding path program 1 times [2024-10-11 19:42:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:30,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101969599] [2024-10-11 19:42:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:30,388 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-11 19:42:30,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:30,391 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:30,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:30,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:42:30,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:30,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-11 19:42:30,522 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-11 19:42:30,522 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:30,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:30,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101969599] [2024-10-11 19:42:30,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101969599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:30,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:30,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:30,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695056573] [2024-10-11 19:42:30,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:30,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:30,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:30,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:30,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:30,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-11 19:42:30,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 94 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11 19:42:30,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:30,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-11 19:42:30,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:31,635 INFO L124 PetriNetUnfolderBase]: 5360/10373 cut-off events. [2024-10-11 19:42:31,635 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-10-11 19:42:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19506 conditions, 10373 events. 5360/10373 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 82588 event pairs, 133 based on Foata normal form. 0/7822 useless extension candidates. Maximal degree in co-relation 14441. Up to 3335 conditions per place. [2024-10-11 19:42:31,666 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 167 selfloop transitions, 13 changer transitions 1/213 dead transitions. [2024-10-11 19:42:31,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 213 transitions, 824 flow [2024-10-11 19:42:31,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:42:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:42:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 540 transitions. [2024-10-11 19:42:31,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.54 [2024-10-11 19:42:31,668 INFO L175 Difference]: Start difference. First operand has 97 places, 94 transitions, 211 flow. Second operand 8 states and 540 transitions. [2024-10-11 19:42:31,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 213 transitions, 824 flow [2024-10-11 19:42:31,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 213 transitions, 817 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:42:31,679 INFO L231 Difference]: Finished difference. Result has 107 places, 103 transitions, 299 flow [2024-10-11 19:42:31,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=107, PETRI_TRANSITIONS=103} [2024-10-11 19:42:31,680 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -12 predicate places. [2024-10-11 19:42:31,680 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 103 transitions, 299 flow [2024-10-11 19:42:31,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11 19:42:31,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:31,680 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:31,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:31,881 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-11 19:42:31,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1751356454, now seen corresponding path program 1 times [2024-10-11 19:42:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602252374] [2024-10-11 19:42:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:31,882 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-11 19:42:31,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:31,885 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:31,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:31,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 19:42:31,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:31,982 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-11 19:42:32,046 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-11 19:42:32,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:32,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:32,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602252374] [2024-10-11 19:42:32,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602252374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:32,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:32,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:32,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529250980] [2024-10-11 19:42:32,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:32,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:32,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:32,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:32,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:32,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-11 19:42:32,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 103 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11 19:42:32,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:32,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-11 19:42:32,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:33,113 INFO L124 PetriNetUnfolderBase]: 3897/7584 cut-off events. [2024-10-11 19:42:33,114 INFO L125 PetriNetUnfolderBase]: For 2753/2759 co-relation queries the response was YES. [2024-10-11 19:42:33,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15891 conditions, 7584 events. 3897/7584 cut-off events. For 2753/2759 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 55990 event pairs, 731 based on Foata normal form. 782/7131 useless extension candidates. Maximal degree in co-relation 14428. Up to 3099 conditions per place. [2024-10-11 19:42:33,146 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 149 selfloop transitions, 10 changer transitions 2/193 dead transitions. [2024-10-11 19:42:33,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 193 transitions, 821 flow [2024-10-11 19:42:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:42:33,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:42:33,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 470 transitions. [2024-10-11 19:42:33,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5371428571428571 [2024-10-11 19:42:33,149 INFO L175 Difference]: Start difference. First operand has 107 places, 103 transitions, 299 flow. Second operand 7 states and 470 transitions. [2024-10-11 19:42:33,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 193 transitions, 821 flow [2024-10-11 19:42:33,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 193 transitions, 821 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:42:33,160 INFO L231 Difference]: Finished difference. Result has 116 places, 105 transitions, 352 flow [2024-10-11 19:42:33,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=352, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2024-10-11 19:42:33,160 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2024-10-11 19:42:33,161 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 352 flow [2024-10-11 19:42:33,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 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-11 19:42:33,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:33,161 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:33,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:42:33,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:33,362 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-11 19:42:33,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1802651144, now seen corresponding path program 1 times [2024-10-11 19:42:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899398970] [2024-10-11 19:42:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:33,364 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-11 19:42:33,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:33,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:33,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:33,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 19:42:33,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:33,472 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-11 19:42:33,519 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-11 19:42:33,519 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:33,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:33,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899398970] [2024-10-11 19:42:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899398970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:33,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690650222] [2024-10-11 19:42:33,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:33,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:33,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:33,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-11 19:42:33,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11 19:42:33,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:33,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-11 19:42:33,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:34,752 INFO L124 PetriNetUnfolderBase]: 3438/6716 cut-off events. [2024-10-11 19:42:34,753 INFO L125 PetriNetUnfolderBase]: For 4667/4667 co-relation queries the response was YES. [2024-10-11 19:42:34,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15048 conditions, 6716 events. 3438/6716 cut-off events. For 4667/4667 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 48851 event pairs, 191 based on Foata normal form. 0/5871 useless extension candidates. Maximal degree in co-relation 13724. Up to 1941 conditions per place. [2024-10-11 19:42:34,781 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 158 selfloop transitions, 17 changer transitions 0/207 dead transitions. [2024-10-11 19:42:34,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 207 transitions, 1043 flow [2024-10-11 19:42:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 19:42:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 19:42:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 522 transitions. [2024-10-11 19:42:34,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.522 [2024-10-11 19:42:34,784 INFO L175 Difference]: Start difference. First operand has 116 places, 105 transitions, 352 flow. Second operand 8 states and 522 transitions. [2024-10-11 19:42:34,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 207 transitions, 1043 flow [2024-10-11 19:42:34,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 207 transitions, 1013 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:42:34,795 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 455 flow [2024-10-11 19:42:34,795 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=455, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-10-11 19:42:34,796 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 3 predicate places. [2024-10-11 19:42:34,796 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 455 flow [2024-10-11 19:42:34,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11 19:42:34,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:34,797 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:34,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:42:34,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:34,998 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-11 19:42:34,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1802651145, now seen corresponding path program 1 times [2024-10-11 19:42:34,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:34,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054456769] [2024-10-11 19:42:34,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:34,999 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-11 19:42:34,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:35,001 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:35,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:35,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 19:42:35,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:35,115 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-11 19:42:35,177 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-11 19:42:35,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:35,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:35,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054456769] [2024-10-11 19:42:35,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054456769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:35,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:35,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:35,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910242299] [2024-10-11 19:42:35,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:35,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:42:35,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:35,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:42:35,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:42:35,289 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 125 [2024-10-11 19:42:35,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11 19:42:35,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:35,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 125 [2024-10-11 19:42:35,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:36,251 INFO L124 PetriNetUnfolderBase]: 2519/5013 cut-off events. [2024-10-11 19:42:36,251 INFO L125 PetriNetUnfolderBase]: For 4918/4934 co-relation queries the response was YES. [2024-10-11 19:42:36,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12437 conditions, 5013 events. 2519/5013 cut-off events. For 4918/4934 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 34622 event pairs, 342 based on Foata normal form. 536/5407 useless extension candidates. Maximal degree in co-relation 11357. Up to 2291 conditions per place. [2024-10-11 19:42:36,271 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 143 selfloop transitions, 14 changer transitions 1/190 dead transitions. [2024-10-11 19:42:36,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 190 transitions, 1021 flow [2024-10-11 19:42:36,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 19:42:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 19:42:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 453 transitions. [2024-10-11 19:42:36,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5177142857142857 [2024-10-11 19:42:36,273 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 455 flow. Second operand 7 states and 453 transitions. [2024-10-11 19:42:36,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 190 transitions, 1021 flow [2024-10-11 19:42:36,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 190 transitions, 1018 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:42:36,284 INFO L231 Difference]: Finished difference. Result has 130 places, 117 transitions, 526 flow [2024-10-11 19:42:36,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=526, PETRI_PLACES=130, PETRI_TRANSITIONS=117} [2024-10-11 19:42:36,285 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 11 predicate places. [2024-10-11 19:42:36,285 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 117 transitions, 526 flow [2024-10-11 19:42:36,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 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-11 19:42:36,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:36,285 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:36,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:36,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:36,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-11 19:42:36,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1800086855, now seen corresponding path program 1 times [2024-10-11 19:42:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:36,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169714367] [2024-10-11 19:42:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:36,488 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-11 19:42:36,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:36,489 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:36,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:36,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 19:42:36,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:36,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:36,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:36,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:36,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:36,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:36,633 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-11 19:42:36,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:36,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:36,675 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 83 treesize of output 73 [2024-10-11 19:42:36,710 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-11 19:42:36,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:36,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169714367] [2024-10-11 19:42:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169714367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:42:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654308585] [2024-10-11 19:42:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:36,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:42:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:42:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:42:36,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 125 [2024-10-11 19:42:36,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 117 transitions, 526 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-11 19:42:36,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:36,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 125 [2024-10-11 19:42:36,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:38,074 INFO L124 PetriNetUnfolderBase]: 3383/6011 cut-off events. [2024-10-11 19:42:38,074 INFO L125 PetriNetUnfolderBase]: For 9593/9608 co-relation queries the response was YES. [2024-10-11 19:42:38,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16396 conditions, 6011 events. 3383/6011 cut-off events. For 9593/9608 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 38747 event pairs, 2013 based on Foata normal form. 0/5731 useless extension candidates. Maximal degree in co-relation 15101. Up to 4531 conditions per place. [2024-10-11 19:42:38,096 INFO L140 encePairwiseOnDemand]: 115/125 looper letters, 109 selfloop transitions, 16 changer transitions 0/154 dead transitions. [2024-10-11 19:42:38,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 154 transitions, 931 flow [2024-10-11 19:42:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:42:38,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:42:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2024-10-11 19:42:38,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.528 [2024-10-11 19:42:38,097 INFO L175 Difference]: Start difference. First operand has 130 places, 117 transitions, 526 flow. Second operand 4 states and 264 transitions. [2024-10-11 19:42:38,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 154 transitions, 931 flow [2024-10-11 19:42:38,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 154 transitions, 901 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 19:42:38,107 INFO L231 Difference]: Finished difference. Result has 131 places, 131 transitions, 671 flow [2024-10-11 19:42:38,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=671, PETRI_PLACES=131, PETRI_TRANSITIONS=131} [2024-10-11 19:42:38,108 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 12 predicate places. [2024-10-11 19:42:38,108 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 131 transitions, 671 flow [2024-10-11 19:42:38,108 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-11 19:42:38,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:38,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:38,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:38,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:38,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-11 19:42:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -31881743, now seen corresponding path program 1 times [2024-10-11 19:42:38,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:38,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064389220] [2024-10-11 19:42:38,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:38,310 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-11 19:42:38,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:38,311 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:38,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:38,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 19:42:38,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:38,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:38,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:38,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 19:42:38,464 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:38,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:38,468 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-11 19:42:38,508 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-11 19:42:38,508 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:38,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:38,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064389220] [2024-10-11 19:42:38,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064389220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:38,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:38,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:42:38,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662455458] [2024-10-11 19:42:38,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:38,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:42:38,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:38,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:42:38,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:42:38,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-10-11 19:42:38,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 131 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-11 19:42:38,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:38,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-10-11 19:42:38,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:39,451 INFO L124 PetriNetUnfolderBase]: 3647/6465 cut-off events. [2024-10-11 19:42:39,451 INFO L125 PetriNetUnfolderBase]: For 12550/12574 co-relation queries the response was YES. [2024-10-11 19:42:39,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20053 conditions, 6465 events. 3647/6465 cut-off events. For 12550/12574 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 41900 event pairs, 2263 based on Foata normal form. 127/6557 useless extension candidates. Maximal degree in co-relation 18682. Up to 4937 conditions per place. [2024-10-11 19:42:39,479 INFO L140 encePairwiseOnDemand]: 117/125 looper letters, 103 selfloop transitions, 23 changer transitions 0/156 dead transitions. [2024-10-11 19:42:39,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 156 transitions, 1077 flow [2024-10-11 19:42:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:42:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:42:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-10-11 19:42:39,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5546666666666666 [2024-10-11 19:42:39,480 INFO L175 Difference]: Start difference. First operand has 131 places, 131 transitions, 671 flow. Second operand 3 states and 208 transitions. [2024-10-11 19:42:39,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 156 transitions, 1077 flow [2024-10-11 19:42:39,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 156 transitions, 1077 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 19:42:39,525 INFO L231 Difference]: Finished difference. Result has 135 places, 144 transitions, 905 flow [2024-10-11 19:42:39,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=905, PETRI_PLACES=135, PETRI_TRANSITIONS=144} [2024-10-11 19:42:39,525 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2024-10-11 19:42:39,526 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 144 transitions, 905 flow [2024-10-11 19:42:39,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-11 19:42:39,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:39,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:39,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:39,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:39,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-11 19:42:39,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 663373826, now seen corresponding path program 1 times [2024-10-11 19:42:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657424686] [2024-10-11 19:42:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:39,727 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-11 19:42:39,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:39,729 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:39,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:42:39,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 19:42:39,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:42:39,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:39,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:39,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 19:42:39,871 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-11 19:42:39,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:39,912 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-11 19:42:39,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 19:42:39,947 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-11 19:42:39,957 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-11 19:42:39,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:42:39,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:42:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657424686] [2024-10-11 19:42:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657424686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:42:39,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:42:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:42:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704757966] [2024-10-11 19:42:39,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:42:39,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:42:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:42:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:42:39,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:42:40,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 125 [2024-10-11 19:42:40,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 144 transitions, 905 flow. Second operand has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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-11 19:42:40,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:42:40,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 125 [2024-10-11 19:42:40,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:42:41,455 INFO L124 PetriNetUnfolderBase]: 4081/7391 cut-off events. [2024-10-11 19:42:41,455 INFO L125 PetriNetUnfolderBase]: For 20196/20214 co-relation queries the response was YES. [2024-10-11 19:42:41,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24570 conditions, 7391 events. 4081/7391 cut-off events. For 20196/20214 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 50819 event pairs, 2379 based on Foata normal form. 125/7474 useless extension candidates. Maximal degree in co-relation 22930. Up to 5803 conditions per place. [2024-10-11 19:42:41,486 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 146 selfloop transitions, 18 changer transitions 0/194 dead transitions. [2024-10-11 19:42:41,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 194 transitions, 1481 flow [2024-10-11 19:42:41,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:42:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:42:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 323 transitions. [2024-10-11 19:42:41,487 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5168 [2024-10-11 19:42:41,487 INFO L175 Difference]: Start difference. First operand has 135 places, 144 transitions, 905 flow. Second operand 5 states and 323 transitions. [2024-10-11 19:42:41,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 194 transitions, 1481 flow [2024-10-11 19:42:41,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 194 transitions, 1435 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:42:41,532 INFO L231 Difference]: Finished difference. Result has 140 places, 158 transitions, 1053 flow [2024-10-11 19:42:41,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1053, PETRI_PLACES=140, PETRI_TRANSITIONS=158} [2024-10-11 19:42:41,532 INFO L277 CegarLoopForPetriNet]: 119 programPoint places, 21 predicate places. [2024-10-11 19:42:41,533 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 158 transitions, 1053 flow [2024-10-11 19:42:41,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.5) internal successors, (178), 4 states have internal predecessors, (178), 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-11 19:42:41,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:42:41,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:41,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:41,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:41,733 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-10-11 19:42:41,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:42:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash -367802849, now seen corresponding path program 1 times [2024-10-11 19:42:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:42:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437065883] [2024-10-11 19:42:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:42:41,734 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-11 19:42:41,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:42:41,735 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:42:41,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:42:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:42:42,022 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:42:42,022 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:42:42,023 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-10-11 19:42:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-10-11 19:42:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-10-11 19:42:42,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-10-11 19:42:42,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-10-11 19:42:42,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-10-11 19:42:42,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (25 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (22 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-10-11 19:42:42,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-10-11 19:42:42,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-10-11 19:42:42,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-10-11 19:42:42,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-10-11 19:42:42,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-10-11 19:42:42,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-10-11 19:42:42,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-10-11 19:42:42,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-10-11 19:42:42,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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)] Forceful destruction successful, exit code 0 [2024-10-11 19:42:42,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -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-11 19:42:42,231 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:42:42,261 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:42:42,261 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:42:42,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:42:42 BasicIcfg [2024-10-11 19:42:42,266 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:42:42,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:42:42,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:42:42,266 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:42:42,267 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:42:22" (3/4) ... [2024-10-11 19:42:42,268 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:42:42,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:42:42,269 INFO L158 Benchmark]: Toolchain (without parser) took 21686.03ms. Allocated memory was 77.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 36.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 316.0MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,269 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:42:42,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 622.98ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 36.8MB in the beginning and 63.0MB in the end (delta: -26.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.42ms. Allocated memory is still 109.1MB. Free memory was 63.0MB in the beginning and 60.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,270 INFO L158 Benchmark]: Boogie Preprocessor took 72.79ms. Allocated memory is still 109.1MB. Free memory was 60.3MB in the beginning and 55.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,270 INFO L158 Benchmark]: RCFGBuilder took 880.44ms. Allocated memory is still 109.1MB. Free memory was 55.2MB in the beginning and 52.3MB in the end (delta: 2.9MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,270 INFO L158 Benchmark]: TraceAbstraction took 20054.15ms. Allocated memory was 109.1MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 51.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 296.6MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,270 INFO L158 Benchmark]: Witness Printer took 2.59ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:42:42,273 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.18ms. Allocated memory is still 77.6MB. Free memory is still 60.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 622.98ms. Allocated memory was 77.6MB in the beginning and 109.1MB in the end (delta: 31.5MB). Free memory was 36.8MB in the beginning and 63.0MB in the end (delta: -26.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.42ms. Allocated memory is still 109.1MB. Free memory was 63.0MB in the beginning and 60.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.79ms. Allocated memory is still 109.1MB. Free memory was 60.3MB in the beginning and 55.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 880.44ms. Allocated memory is still 109.1MB. Free memory was 55.2MB in the beginning and 52.3MB in the end (delta: 2.9MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20054.15ms. Allocated memory was 109.1MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 51.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 296.6MB. Max. memory is 16.1GB. * Witness Printer took 2.59ms. Allocated memory is still 2.5GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 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) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, res=0, t1=0, t2=1] [L3933] 0 data->shared.a = 3 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3936] 0 data->shared.b = 3 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3939] EXPR 0 data->shared.a [L3939] 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_3-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_3-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, 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: -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: 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: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: -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, 132 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: 19.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1456 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1175 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2968 IncrementalHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 6 mSDtfsCounter, 2968 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=12, InterpolantAutomatonStates: 57, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 127 NumberOfCodeBlocks, 127 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 727 SizeOfPredicates, 58 NumberOfNonLiveVariables, 1107 ConjunctsInSsa, 112 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11 19:42:42,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample