./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:03:40,090 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:03:40,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:03:40,195 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:03:40,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:03:40,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:03:40,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:03:40,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:03:40,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:03:40,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:03:40,228 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:03:40,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:03:40,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:03:40,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:03:40,232 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:03:40,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:03:40,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:03:40,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:03:40,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:03:40,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:03:40,237 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:03:40,238 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:03:40,238 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:03:40,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:03:40,239 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:03:40,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:03:40,239 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:03:40,240 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:03:40,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:03:40,240 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:03:40,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:03:40,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:03:40,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:03:40,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:40,242 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:03:40,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:03:40,242 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:03:40,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:03:40,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:03:40,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:03:40,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:03:40,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:03:40,245 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-11-10 18:03:40,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:03:40,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:03:40,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:03:40,551 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:03:40,552 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:03:40,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-10 18:03:42,099 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:03:42,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:03:42,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-10 18:03:42,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f69e6ccc/17559c9dd5e04073ab8cce8c09479a38/FLAGec4ed6548 [2024-11-10 18:03:42,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f69e6ccc/17559c9dd5e04073ab8cce8c09479a38 [2024-11-10 18:03:42,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:03:42,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:03:42,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:42,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:03:42,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:03:42,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:42" (1/1) ... [2024-11-10 18:03:42,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3487742a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:42, skipping insertion in model container [2024-11-10 18:03:42,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:42" (1/1) ... [2024-11-10 18:03:42,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:03:43,078 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:43,095 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:43,108 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:43,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:43,144 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-10 18:03:43,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4316aa21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:43, skipping insertion in model container [2024-11-10 18:03:43,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:43,146 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 18:03:43,148 INFO L158 Benchmark]: Toolchain (without parser) took 630.18ms. Allocated memory is still 159.4MB. Free memory was 107.9MB in the beginning and 84.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 18:03:43,149 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:03:43,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.26ms. Allocated memory is still 159.4MB. Free memory was 107.4MB in the beginning and 84.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 18:03:43,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.26ms. Allocated memory is still 159.4MB. Free memory was 107.4MB in the beginning and 84.4MB in the end (delta: 23.1MB). 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:03:45,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:03:45,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:03:45,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:03:45,380 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:03:45,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:03:45,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:03:45,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:03:45,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:03:45,433 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:03:45,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:03:45,434 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:03:45,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:03:45,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:03:45,437 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:03:45,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:03:45,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:03:45,438 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:03:45,438 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:03:45,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:03:45,438 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:03:45,442 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:03:45,443 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:03:45,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:03:45,443 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:03:45,443 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:03:45,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:03:45,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:03:45,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:03:45,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:03:45,444 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:03:45,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:03:45,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:03:45,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:03:45,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:03:45,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:45,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:03:45,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:03:45,448 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:03:45,448 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:03:45,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:03:45,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:03:45,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:03:45,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:03:45,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-11-10 18:03:45,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:03:45,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:03:45,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:03:45,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:03:45,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:03:45,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-10 18:03:47,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:03:47,869 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:03:47,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-10 18:03:47,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b52ea85/13942a2d7bbe488498d20758cbb7bc4c/FLAGa6c14e8fd [2024-11-10 18:03:47,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b52ea85/13942a2d7bbe488498d20758cbb7bc4c [2024-11-10 18:03:47,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:03:47,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:03:47,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:47,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:03:47,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:03:47,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:47" (1/1) ... [2024-11-10 18:03:47,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545315a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:47, skipping insertion in model container [2024-11-10 18:03:47,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:03:47" (1/1) ... [2024-11-10 18:03:48,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:03:48,469 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:48,486 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:48,493 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:48,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:48,522 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 18:03:48,540 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:03:48,585 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:48,589 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:48,592 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 18:03:48,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:48,609 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:03:48,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:03:48,757 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:03:48,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48 WrapperNode [2024-11-10 18:03:48,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:03:48,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:03:48,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:03:48,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:03:48,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,840 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-11-10 18:03:48,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:03:48,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:03:48,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:03:48,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:03:48,855 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,905 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-11-10 18:03:48,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,930 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:03:48,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:03:48,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:03:48,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:03:48,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (1/1) ... [2024-11-10 18:03:48,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:03:48,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:03:48,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:03:49,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:03:49,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-10 18:03:49,053 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 18:03:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 18:03:49,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 18:03:49,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 18:03:49,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:03:49,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:03:49,058 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:03:49,457 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:03:49,459 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:03:50,048 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:03:50,049 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:03:50,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:03:50,289 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:03:50,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:50 BoogieIcfgContainer [2024-11-10 18:03:50,290 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:03:50,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:03:50,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:03:50,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:03:50,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:03:47" (1/3) ... [2024-11-10 18:03:50,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2796355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:50, skipping insertion in model container [2024-11-10 18:03:50,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:03:48" (2/3) ... [2024-11-10 18:03:50,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2796355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:03:50, skipping insertion in model container [2024-11-10 18:03:50,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:50" (3/3) ... [2024-11-10 18:03:50,301 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2024-11-10 18:03:50,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:03:50,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-10 18:03:50,320 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:03:50,423 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 18:03:50,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-11-10 18:03:50,545 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2024-11-10 18:03:50,545 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 18:03:50,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 14/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 695 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-10 18:03:50,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-11-10 18:03:50,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-11-10 18:03:50,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:03:50,579 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;@59c43550, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:03:50,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-10 18:03:50,583 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:03:50,584 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-10 18:03:50,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:03:50,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:50,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-10 18:03:50,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:03:50,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 557859, now seen corresponding path program 1 times [2024-11-10 18:03:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:03:50,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574525778] [2024-11-10 18:03:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:50,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:50,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:03:50,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:03:50,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:03:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:50,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:03:50,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:03:50,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:03:50,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:50,871 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:03:50,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:03:50,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574525778] [2024-11-10 18:03:50,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574525778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:50,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:50,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:03:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538996132] [2024-11-10 18:03:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:50,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:03:50,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:03:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:03:50,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:03:51,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-10 18:03:51,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:51,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:51,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-10 18:03:51,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:53,827 INFO L124 PetriNetUnfolderBase]: 9687/18675 cut-off events. [2024-11-10 18:03:53,828 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-10 18:03:53,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33796 conditions, 18675 events. 9687/18675 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 178776 event pairs, 559 based on Foata normal form. 792/11730 useless extension candidates. Maximal degree in co-relation 33526. Up to 14089 conditions per place. [2024-11-10 18:03:53,973 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 95 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-11-10 18:03:53,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 474 flow [2024-11-10 18:03:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:03:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:03:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-10 18:03:53,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2024-11-10 18:03:53,990 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 224 transitions. [2024-11-10 18:03:53,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 474 flow [2024-11-10 18:03:53,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 466 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:03:54,003 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-10 18:03:54,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2024-11-10 18:03:54,010 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-11-10 18:03:54,012 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-10 18:03:54,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:54,013 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:54,013 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-10 18:03:54,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-10 18:03:54,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:54,215 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:03:54,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 557860, now seen corresponding path program 1 times [2024-11-10 18:03:54,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:03:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305056111] [2024-11-10 18:03:54,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:03:54,220 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:03:54,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:03:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:54,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:03:54,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:03:54,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:03:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:54,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:03:54,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:03:54,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305056111] [2024-11-10 18:03:54,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305056111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:54,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:54,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:03:54,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641842012] [2024-11-10 18:03:54,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:54,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:03:54,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:03:54,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:03:54,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:03:54,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-10 18:03:54,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:54,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:54,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-10 18:03:54,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:56,687 INFO L124 PetriNetUnfolderBase]: 9687/18673 cut-off events. [2024-11-10 18:03:56,688 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-10 18:03:56,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33960 conditions, 18673 events. 9687/18673 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 178988 event pairs, 559 based on Foata normal form. 1/10937 useless extension candidates. Maximal degree in co-relation 1994. Up to 14089 conditions per place. [2024-11-10 18:03:56,832 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-11-10 18:03:56,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 464 flow [2024-11-10 18:03:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:03:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:03:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-11-10 18:03:56,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-11-10 18:03:56,839 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 218 transitions. [2024-11-10 18:03:56,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 464 flow [2024-11-10 18:03:56,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:03:56,846 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-11-10 18:03:56,846 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2024-11-10 18:03:56,848 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-10 18:03:56,848 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-11-10 18:03:56,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:56,849 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:56,849 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-10 18:03:56,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 18:03:57,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:57,050 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:03:57,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:57,051 INFO L85 PathProgramCache]: Analyzing trace with hash 17292180, now seen corresponding path program 1 times [2024-11-10 18:03:57,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:03:57,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987016936] [2024-11-10 18:03:57,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:57,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:57,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:03:57,054 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:03:57,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:03:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:57,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:03:57,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:03:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:57,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:03:57,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:03:57,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987016936] [2024-11-10 18:03:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987016936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:03:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300301123] [2024-11-10 18:03:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:57,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:03:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:03:57,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:03:57,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:03:57,272 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-10 18:03:57,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:57,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:57,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-10 18:03:57,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:03:58,734 INFO L124 PetriNetUnfolderBase]: 9686/16135 cut-off events. [2024-11-10 18:03:58,735 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-11-10 18:03:58,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31422 conditions, 16135 events. 9686/16135 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 122242 event pairs, 9321 based on Foata normal form. 1/9362 useless extension candidates. Maximal degree in co-relation 16816. Up to 14510 conditions per place. [2024-11-10 18:03:58,855 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-10 18:03:58,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 462 flow [2024-11-10 18:03:58,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:03:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:03:58,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-11-10 18:03:58,858 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-11-10 18:03:58,858 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 220 transitions. [2024-11-10 18:03:58,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 462 flow [2024-11-10 18:03:58,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:03:58,864 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-11-10 18:03:58,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=108, PETRI_TRANSITIONS=105} [2024-11-10 18:03:58,865 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-10 18:03:58,865 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-11-10 18:03:58,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:58,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:03:58,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:03:58,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 18:03:59,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:59,067 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:03:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:03:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1496791701, now seen corresponding path program 1 times [2024-11-10 18:03:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:03:59,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325510239] [2024-11-10 18:03:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:03:59,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:03:59,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:03:59,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:03:59,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:03:59,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:03:59,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:03:59,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:03:59,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:03:59,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:03:59,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:03:59,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325510239] [2024-11-10 18:03:59,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325510239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:03:59,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:03:59,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:03:59,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229541549] [2024-11-10 18:03:59,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:03:59,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:03:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:03:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:03:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:03:59,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:03:59,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:03:59,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:03:59,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:03:59,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:00,518 INFO L124 PetriNetUnfolderBase]: 9685/16735 cut-off events. [2024-11-10 18:04:00,518 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 18:04:00,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32017 conditions, 16735 events. 9685/16735 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 132733 event pairs, 9685 based on Foata normal form. 1/9903 useless extension candidates. Maximal degree in co-relation 30689. Up to 15055 conditions per place. [2024-11-10 18:04:00,622 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 76 selfloop transitions, 3 changer transitions 1/115 dead transitions. [2024-11-10 18:04:00,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 115 transitions, 400 flow [2024-11-10 18:04:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-11-10 18:04:00,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2024-11-10 18:04:00,625 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 4 states and 249 transitions. [2024-11-10 18:04:00,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 115 transitions, 400 flow [2024-11-10 18:04:00,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:00,642 INFO L231 Difference]: Finished difference. Result has 111 places, 107 transitions, 235 flow [2024-11-10 18:04:00,642 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=111, PETRI_TRANSITIONS=107} [2024-11-10 18:04:00,643 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -7 predicate places. [2024-11-10 18:04:00,643 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 107 transitions, 235 flow [2024-11-10 18:04:00,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:00,644 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:00,644 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:00,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:04:00,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:00,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:00,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:00,846 INFO L85 PathProgramCache]: Analyzing trace with hash 844097183, now seen corresponding path program 1 times [2024-11-10 18:04:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134513938] [2024-11-10 18:04:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:00,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:00,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:00,851 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:00,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:04:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:00,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:04:00,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:00,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:01,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:01,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:01,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134513938] [2024-11-10 18:04:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134513938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:01,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456605514] [2024-11-10 18:04:01,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:01,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:01,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:01,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:01,078 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 124 [2024-11-10 18:04:01,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:01,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:01,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 124 [2024-11-10 18:04:01,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:02,975 INFO L124 PetriNetUnfolderBase]: 10413/17239 cut-off events. [2024-11-10 18:04:02,975 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2024-11-10 18:04:03,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34043 conditions, 17239 events. 10413/17239 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 130125 event pairs, 9321 based on Foata normal form. 0/10288 useless extension candidates. Maximal degree in co-relation 33995. Up to 14501 conditions per place. [2024-11-10 18:04:03,076 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 96 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-11-10 18:04:03,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 128 transitions, 479 flow [2024-11-10 18:04:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:03,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2024-11-10 18:04:03,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2024-11-10 18:04:03,078 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 235 flow. Second operand 3 states and 206 transitions. [2024-11-10 18:04:03,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 128 transitions, 479 flow [2024-11-10 18:04:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:04:03,093 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 234 flow [2024-11-10 18:04:03,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-10 18:04:03,094 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -11 predicate places. [2024-11-10 18:04:03,095 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 234 flow [2024-11-10 18:04:03,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:03,095 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:03,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:03,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 18:04:03,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:03,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:03,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash 844097184, now seen corresponding path program 1 times [2024-11-10 18:04:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:03,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85645101] [2024-11-10 18:04:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:03,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:03,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:03,302 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:03,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:04:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:03,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:04:03,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:03,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:03,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:03,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:03,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85645101] [2024-11-10 18:04:03,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85645101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:03,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:03,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:03,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743701632] [2024-11-10 18:04:03,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:03,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:03,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:03,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:03,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 124 [2024-11-10 18:04:03,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 234 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-11-10 18:04:03,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:03,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 124 [2024-11-10 18:04:03,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:05,109 INFO L124 PetriNetUnfolderBase]: 9685/16158 cut-off events. [2024-11-10 18:04:05,110 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2024-11-10 18:04:05,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32044 conditions, 16158 events. 9685/16158 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 124533 event pairs, 3107 based on Foata normal form. 394/9933 useless extension candidates. Maximal degree in co-relation 28012. Up to 10162 conditions per place. [2024-11-10 18:04:05,206 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 107 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-11-10 18:04:05,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 135 transitions, 526 flow [2024-11-10 18:04:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2024-11-10 18:04:05,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5940860215053764 [2024-11-10 18:04:05,208 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 234 flow. Second operand 3 states and 221 transitions. [2024-11-10 18:04:05,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 135 transitions, 526 flow [2024-11-10 18:04:05,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:05,229 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 250 flow [2024-11-10 18:04:05,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2024-11-10 18:04:05,230 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-10 18:04:05,230 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 250 flow [2024-11-10 18:04:05,230 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-11-10 18:04:05,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:05,230 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:05,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-10 18:04:05,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:05,432 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:05,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash 509166757, now seen corresponding path program 1 times [2024-11-10 18:04:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:05,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95337695] [2024-11-10 18:04:05,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:05,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:05,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:05,435 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:05,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:04:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:05,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 18:04:05,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:05,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:05,679 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:05,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95337695] [2024-11-10 18:04:05,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95337695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:05,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:05,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031442319] [2024-11-10 18:04:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:05,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:05,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:04:05,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:05,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:05,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:04:05,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:07,169 INFO L124 PetriNetUnfolderBase]: 8707/15190 cut-off events. [2024-11-10 18:04:07,169 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2024-11-10 18:04:07,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29877 conditions, 15190 events. 8707/15190 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 121805 event pairs, 799 based on Foata normal form. 0/9380 useless extension candidates. Maximal degree in co-relation 9239. Up to 8441 conditions per place. [2024-11-10 18:04:07,234 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 157 selfloop transitions, 9 changer transitions 1/197 dead transitions. [2024-11-10 18:04:07,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 197 transitions, 785 flow [2024-11-10 18:04:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:04:07,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:04:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 466 transitions. [2024-11-10 18:04:07,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5368663594470046 [2024-11-10 18:04:07,236 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 250 flow. Second operand 7 states and 466 transitions. [2024-11-10 18:04:07,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 197 transitions, 785 flow [2024-11-10 18:04:07,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 197 transitions, 777 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 18:04:07,257 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 295 flow [2024-11-10 18:04:07,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2024-11-10 18:04:07,258 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-11-10 18:04:07,258 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 295 flow [2024-11-10 18:04:07,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:07,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:07,259 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:07,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:04:07,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:07,460 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:07,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash 509166756, now seen corresponding path program 1 times [2024-11-10 18:04:07,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:07,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887320796] [2024-11-10 18:04:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:07,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:07,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:04:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:07,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 18:04:07,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:07,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:07,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:07,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:07,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887320796] [2024-11-10 18:04:07,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887320796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:07,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:07,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:07,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329726945] [2024-11-10 18:04:07,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:07,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:07,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:07,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:04:07,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:07,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:07,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:04:07,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:09,086 INFO L124 PetriNetUnfolderBase]: 7050/12331 cut-off events. [2024-11-10 18:04:09,086 INFO L125 PetriNetUnfolderBase]: For 3522/3522 co-relation queries the response was YES. [2024-11-10 18:04:09,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26099 conditions, 12331 events. 7050/12331 cut-off events. For 3522/3522 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 93960 event pairs, 685 based on Foata normal form. 0/8927 useless extension candidates. Maximal degree in co-relation 7024. Up to 8172 conditions per place. [2024-11-10 18:04:09,143 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 177 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2024-11-10 18:04:09,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 221 transitions, 913 flow [2024-11-10 18:04:09,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:04:09,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:04:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 533 transitions. [2024-11-10 18:04:09,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5372983870967742 [2024-11-10 18:04:09,146 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 295 flow. Second operand 8 states and 533 transitions. [2024-11-10 18:04:09,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 221 transitions, 913 flow [2024-11-10 18:04:09,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 221 transitions, 906 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-10 18:04:09,163 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 379 flow [2024-11-10 18:04:09,164 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-11-10 18:04:09,164 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2024-11-10 18:04:09,165 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 379 flow [2024-11-10 18:04:09,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:09,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:09,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:09,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 18:04:09,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:09,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:09,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:09,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1319575897, now seen corresponding path program 1 times [2024-11-10 18:04:09,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:09,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018623173] [2024-11-10 18:04:09,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:09,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:09,371 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:09,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:04:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:09,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 18:04:09,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:09,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:09,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:09,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018623173] [2024-11-10 18:04:09,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018623173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:09,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:09,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624021383] [2024-11-10 18:04:09,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:09,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:09,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:09,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:09,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:09,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:04:09,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:09,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:09,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:04:09,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:11,099 INFO L124 PetriNetUnfolderBase]: 6173/10813 cut-off events. [2024-11-10 18:04:11,099 INFO L125 PetriNetUnfolderBase]: For 7642/7642 co-relation queries the response was YES. [2024-11-10 18:04:11,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25431 conditions, 10813 events. 6173/10813 cut-off events. For 7642/7642 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 78933 event pairs, 813 based on Foata normal form. 0/8488 useless extension candidates. Maximal degree in co-relation 22604. Up to 6421 conditions per place. [2024-11-10 18:04:11,144 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 176 selfloop transitions, 17 changer transitions 0/223 dead transitions. [2024-11-10 18:04:11,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 223 transitions, 1132 flow [2024-11-10 18:04:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:04:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:04:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 524 transitions. [2024-11-10 18:04:11,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282258064516129 [2024-11-10 18:04:11,146 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 379 flow. Second operand 8 states and 524 transitions. [2024-11-10 18:04:11,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 223 transitions, 1132 flow [2024-11-10 18:04:11,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 223 transitions, 1108 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 18:04:11,165 INFO L231 Difference]: Finished difference. Result has 133 places, 121 transitions, 491 flow [2024-11-10 18:04:11,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=133, PETRI_TRANSITIONS=121} [2024-11-10 18:04:11,166 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 15 predicate places. [2024-11-10 18:04:11,166 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 491 flow [2024-11-10 18:04:11,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:11,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:11,166 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:11,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:04:11,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:11,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:11,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:11,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1319575896, now seen corresponding path program 1 times [2024-11-10 18:04:11,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:11,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133078232] [2024-11-10 18:04:11,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:11,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:11,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:11,370 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:11,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 18:04:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:11,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 18:04:11,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:11,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:11,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:11,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:11,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133078232] [2024-11-10 18:04:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133078232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:04:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111101452] [2024-11-10 18:04:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:11,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:11,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:11,844 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:04:11,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:11,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:11,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:04:11,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:12,899 INFO L124 PetriNetUnfolderBase]: 5374/9318 cut-off events. [2024-11-10 18:04:12,899 INFO L125 PetriNetUnfolderBase]: For 8921/8923 co-relation queries the response was YES. [2024-11-10 18:04:12,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23984 conditions, 9318 events. 5374/9318 cut-off events. For 8921/8923 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 65560 event pairs, 1522 based on Foata normal form. 458/8552 useless extension candidates. Maximal degree in co-relation 21352. Up to 5129 conditions per place. [2024-11-10 18:04:12,950 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 148 selfloop transitions, 14 changer transitions 1/193 dead transitions. [2024-11-10 18:04:12,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 193 transitions, 1063 flow [2024-11-10 18:04:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:04:12,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:04:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2024-11-10 18:04:12,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.511520737327189 [2024-11-10 18:04:12,953 INFO L175 Difference]: Start difference. First operand has 133 places, 121 transitions, 491 flow. Second operand 7 states and 444 transitions. [2024-11-10 18:04:12,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 193 transitions, 1063 flow [2024-11-10 18:04:12,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 193 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:04:12,969 INFO L231 Difference]: Finished difference. Result has 141 places, 124 transitions, 567 flow [2024-11-10 18:04:12,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=141, PETRI_TRANSITIONS=124} [2024-11-10 18:04:12,970 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-11-10 18:04:12,971 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 124 transitions, 567 flow [2024-11-10 18:04:12,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:12,971 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:12,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:12,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:13,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:13,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:13,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:13,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1321466887, now seen corresponding path program 1 times [2024-11-10 18:04:13,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:13,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489183342] [2024-11-10 18:04:13,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:13,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:13,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:13,175 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:13,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 18:04:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:13,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:04:13,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:13,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:13,390 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 18:04:13,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 18:04:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:13,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:13,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:13,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489183342] [2024-11-10 18:04:13,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489183342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:13,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:13,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:04:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340477543] [2024-11-10 18:04:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:13,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:13,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:13,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 124 [2024-11-10 18:04:13,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 124 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:13,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:13,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 124 [2024-11-10 18:04:13,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:15,113 INFO L124 PetriNetUnfolderBase]: 4718/7969 cut-off events. [2024-11-10 18:04:15,113 INFO L125 PetriNetUnfolderBase]: For 11625/11629 co-relation queries the response was YES. [2024-11-10 18:04:15,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22462 conditions, 7969 events. 4718/7969 cut-off events. For 11625/11629 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 52199 event pairs, 2290 based on Foata normal form. 2/7215 useless extension candidates. Maximal degree in co-relation 20028. Up to 3737 conditions per place. [2024-11-10 18:04:15,163 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 102 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2024-11-10 18:04:15,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 853 flow [2024-11-10 18:04:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2024-11-10 18:04:15,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4778225806451613 [2024-11-10 18:04:15,164 INFO L175 Difference]: Start difference. First operand has 141 places, 124 transitions, 567 flow. Second operand 4 states and 237 transitions. [2024-11-10 18:04:15,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 853 flow [2024-11-10 18:04:15,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 142 transitions, 832 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 18:04:15,179 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 564 flow [2024-11-10 18:04:15,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2024-11-10 18:04:15,180 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2024-11-10 18:04:15,180 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 564 flow [2024-11-10 18:04:15,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:15,180 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:15,181 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:15,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:15,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:15,381 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:15,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:15,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1321466886, now seen corresponding path program 1 times [2024-11-10 18:04:15,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:15,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755106649] [2024-11-10 18:04:15,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:15,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:15,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:15,384 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:15,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-10 18:04:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:15,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 18:04:15,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:15,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:15,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:15,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:15,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:04:15,706 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:04:15,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:04:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:15,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:15,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:15,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755106649] [2024-11-10 18:04:15,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755106649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:15,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:15,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:04:15,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50939143] [2024-11-10 18:04:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:15,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:15,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:15,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:15,802 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 124 [2024-11-10 18:04:15,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-11-10 18:04:15,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:15,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 124 [2024-11-10 18:04:15,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:16,604 INFO L124 PetriNetUnfolderBase]: 3614/6290 cut-off events. [2024-11-10 18:04:16,604 INFO L125 PetriNetUnfolderBase]: For 9481/9485 co-relation queries the response was YES. [2024-11-10 18:04:16,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17900 conditions, 6290 events. 3614/6290 cut-off events. For 9481/9485 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 40813 event pairs, 1834 based on Foata normal form. 2/6010 useless extension candidates. Maximal degree in co-relation 15995. Up to 2373 conditions per place. [2024-11-10 18:04:16,648 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 110 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2024-11-10 18:04:16,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 874 flow [2024-11-10 18:04:16,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2024-11-10 18:04:16,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2024-11-10 18:04:16,650 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 564 flow. Second operand 4 states and 228 transitions. [2024-11-10 18:04:16,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 144 transitions, 874 flow [2024-11-10 18:04:16,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 144 transitions, 848 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:04:16,665 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 552 flow [2024-11-10 18:04:16,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-11-10 18:04:16,665 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-10 18:04:16,666 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 552 flow [2024-11-10 18:04:16,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 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-11-10 18:04:16,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:16,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:16,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:16,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:16,867 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1380658882, now seen corresponding path program 1 times [2024-11-10 18:04:16,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:16,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833316662] [2024-11-10 18:04:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:16,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:16,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:16,869 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:16,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-10 18:04:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:17,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 18:04:17,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:17,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:17,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:17,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:17,080 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:17,080 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:17,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-10 18:04:17,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:17,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:17,127 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:17,140 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:17,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 83 [2024-11-10 18:04:17,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:17,200 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:17,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:17,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833316662] [2024-11-10 18:04:17,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833316662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:17,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:17,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:04:17,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190207574] [2024-11-10 18:04:17,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:17,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:04:17,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:17,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:04:17,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:04:17,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-10 18:04:17,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 552 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:17,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:17,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-10 18:04:17,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:19,116 INFO L124 PetriNetUnfolderBase]: 5038/8557 cut-off events. [2024-11-10 18:04:19,117 INFO L125 PetriNetUnfolderBase]: For 11432/11436 co-relation queries the response was YES. [2024-11-10 18:04:19,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24095 conditions, 8557 events. 5038/8557 cut-off events. For 11432/11436 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 57599 event pairs, 2585 based on Foata normal form. 2/8088 useless extension candidates. Maximal degree in co-relation 21663. Up to 6032 conditions per place. [2024-11-10 18:04:19,167 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 126 selfloop transitions, 13 changer transitions 0/166 dead transitions. [2024-11-10 18:04:19,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 166 transitions, 1032 flow [2024-11-10 18:04:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:04:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:04:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-11-10 18:04:19,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-11-10 18:04:19,169 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 552 flow. Second operand 4 states and 272 transitions. [2024-11-10 18:04:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 166 transitions, 1032 flow [2024-11-10 18:04:19,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 166 transitions, 1008 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:04:19,187 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 648 flow [2024-11-10 18:04:19,188 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=648, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-11-10 18:04:19,188 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-11-10 18:04:19,188 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 648 flow [2024-11-10 18:04:19,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:19,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:19,189 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:19,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:19,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:19,390 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1976672781, now seen corresponding path program 1 times [2024-11-10 18:04:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973973699] [2024-11-10 18:04:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:19,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:19,394 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:19,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-10 18:04:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:19,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 18:04:19,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:19,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-10 18:04:19,660 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,661 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,661 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:19,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:19,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 73 treesize of output 93 [2024-11-10 18:04:19,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 18:04:19,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 161 treesize of output 65 [2024-11-10 18:04:19,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:19,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:19,812 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:19,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973973699] [2024-11-10 18:04:19,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973973699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:19,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:19,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:19,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268866554] [2024-11-10 18:04:19,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:19,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:04:19,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:19,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:04:19,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:04:20,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-10 18:04:20,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 648 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:20,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:20,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-10 18:04:20,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:23,028 INFO L124 PetriNetUnfolderBase]: 5660/9778 cut-off events. [2024-11-10 18:04:23,028 INFO L125 PetriNetUnfolderBase]: For 16661/16665 co-relation queries the response was YES. [2024-11-10 18:04:23,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30219 conditions, 9778 events. 5660/9778 cut-off events. For 16661/16665 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 68824 event pairs, 3574 based on Foata normal form. 244/9992 useless extension candidates. Maximal degree in co-relation 27320. Up to 8178 conditions per place. [2024-11-10 18:04:23,084 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 141 selfloop transitions, 27 changer transitions 0/195 dead transitions. [2024-11-10 18:04:23,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 195 transitions, 1316 flow [2024-11-10 18:04:23,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:04:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:04:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 366 transitions. [2024-11-10 18:04:23,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2024-11-10 18:04:23,086 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 648 flow. Second operand 6 states and 366 transitions. [2024-11-10 18:04:23,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 195 transitions, 1316 flow [2024-11-10 18:04:23,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 195 transitions, 1316 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 18:04:23,106 INFO L231 Difference]: Finished difference. Result has 143 places, 155 transitions, 963 flow [2024-11-10 18:04:23,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=963, PETRI_PLACES=143, PETRI_TRANSITIONS=155} [2024-11-10 18:04:23,107 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-10 18:04:23,107 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 155 transitions, 963 flow [2024-11-10 18:04:23,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:23,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:23,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:23,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-10 18:04:23,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:23,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:23,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:23,309 INFO L85 PathProgramCache]: Analyzing trace with hash 647541460, now seen corresponding path program 1 times [2024-11-10 18:04:23,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:23,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671909230] [2024-11-10 18:04:23,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:23,311 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:23,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-10 18:04:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:23,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 18:04:23,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:23,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:23,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:23,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:23,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:04:23,691 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:04:23,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:04:23,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-11-10 18:04:23,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:23,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671909230] [2024-11-10 18:04:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671909230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:23,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:23,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:23,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037935463] [2024-11-10 18:04:23,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:23,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:04:23,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:23,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:04:23,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:04:24,021 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:04:24,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 155 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:24,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:24,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:04:24,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:25,522 INFO L124 PetriNetUnfolderBase]: 5255/9399 cut-off events. [2024-11-10 18:04:25,522 INFO L125 PetriNetUnfolderBase]: For 19388/19394 co-relation queries the response was YES. [2024-11-10 18:04:25,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30618 conditions, 9399 events. 5255/9399 cut-off events. For 19388/19394 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 67495 event pairs, 1373 based on Foata normal form. 436/9809 useless extension candidates. Maximal degree in co-relation 27789. Up to 4883 conditions per place. [2024-11-10 18:04:25,598 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 214 selfloop transitions, 25 changer transitions 0/270 dead transitions. [2024-11-10 18:04:25,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 270 transitions, 2006 flow [2024-11-10 18:04:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:04:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:04:25,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 549 transitions. [2024-11-10 18:04:25,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49193548387096775 [2024-11-10 18:04:25,601 INFO L175 Difference]: Start difference. First operand has 143 places, 155 transitions, 963 flow. Second operand 9 states and 549 transitions. [2024-11-10 18:04:25,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 270 transitions, 2006 flow [2024-11-10 18:04:25,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 270 transitions, 1945 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-11-10 18:04:25,662 INFO L231 Difference]: Finished difference. Result has 147 places, 153 transitions, 967 flow [2024-11-10 18:04:25,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=967, PETRI_PLACES=147, PETRI_TRANSITIONS=153} [2024-11-10 18:04:25,663 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 29 predicate places. [2024-11-10 18:04:25,663 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 153 transitions, 967 flow [2024-11-10 18:04:25,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:25,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:25,664 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:25,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-10 18:04:25,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:25,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2015627596, now seen corresponding path program 1 times [2024-11-10 18:04:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276703607] [2024-11-10 18:04:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:25,866 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:25,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:25,867 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:25,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-10 18:04:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:26,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 18:04:26,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:26,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 18:04:26,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-10 18:04:26,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:26,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-10 18:04:26,203 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 18:04:26,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-10 18:04:26,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:26,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:26,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:26,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276703607] [2024-11-10 18:04:26,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276703607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:26,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:26,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:04:26,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417671092] [2024-11-10 18:04:26,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:26,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:04:26,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:26,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:04:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:04:26,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-10 18:04:26,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 153 transitions, 967 flow. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:26,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:26,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-10 18:04:26,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:28,111 INFO L124 PetriNetUnfolderBase]: 5522/9943 cut-off events. [2024-11-10 18:04:28,112 INFO L125 PetriNetUnfolderBase]: For 21678/21682 co-relation queries the response was YES. [2024-11-10 18:04:28,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32177 conditions, 9943 events. 5522/9943 cut-off events. For 21678/21682 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 72538 event pairs, 1670 based on Foata normal form. 328/10251 useless extension candidates. Maximal degree in co-relation 29189. Up to 4069 conditions per place. [2024-11-10 18:04:28,195 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 218 selfloop transitions, 25 changer transitions 0/274 dead transitions. [2024-11-10 18:04:28,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 274 transitions, 2053 flow [2024-11-10 18:04:28,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:04:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:04:28,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 550 transitions. [2024-11-10 18:04:28,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.492831541218638 [2024-11-10 18:04:28,198 INFO L175 Difference]: Start difference. First operand has 147 places, 153 transitions, 967 flow. Second operand 9 states and 550 transitions. [2024-11-10 18:04:28,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 274 transitions, 2053 flow [2024-11-10 18:04:28,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 274 transitions, 2000 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-10 18:04:28,270 INFO L231 Difference]: Finished difference. Result has 145 places, 151 transitions, 973 flow [2024-11-10 18:04:28,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=973, PETRI_PLACES=145, PETRI_TRANSITIONS=151} [2024-11-10 18:04:28,271 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-11-10 18:04:28,271 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 151 transitions, 973 flow [2024-11-10 18:04:28,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:28,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:28,272 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:28,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-10 18:04:28,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:28,472 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:28,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:28,473 INFO L85 PathProgramCache]: Analyzing trace with hash -149247090, now seen corresponding path program 1 times [2024-11-10 18:04:28,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:28,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667095962] [2024-11-10 18:04:28,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:28,476 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:28,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-10 18:04:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:04:28,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 18:04:28,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:04:28,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:28,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:28,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 18:04:28,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:28,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 18:04:28,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-10 18:04:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:04:28,720 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:04:28,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:04:28,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667095962] [2024-11-10 18:04:28,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667095962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:04:28,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:04:28,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:04:28,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226192010] [2024-11-10 18:04:28,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:04:28,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:04:28,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:04:28,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:04:28,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:04:28,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-10 18:04:28,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 151 transitions, 973 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:28,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:04:28,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-10 18:04:28,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:04:30,276 INFO L124 PetriNetUnfolderBase]: 5939/10460 cut-off events. [2024-11-10 18:04:30,276 INFO L125 PetriNetUnfolderBase]: For 24209/24211 co-relation queries the response was YES. [2024-11-10 18:04:30,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34812 conditions, 10460 events. 5939/10460 cut-off events. For 24209/24211 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 75749 event pairs, 3900 based on Foata normal form. 120/10543 useless extension candidates. Maximal degree in co-relation 31775. Up to 8730 conditions per place. [2024-11-10 18:04:30,354 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 132 selfloop transitions, 18 changer transitions 0/177 dead transitions. [2024-11-10 18:04:30,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 177 transitions, 1417 flow [2024-11-10 18:04:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:04:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:04:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-11-10 18:04:30,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-11-10 18:04:30,356 INFO L175 Difference]: Start difference. First operand has 145 places, 151 transitions, 973 flow. Second operand 3 states and 198 transitions. [2024-11-10 18:04:30,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 177 transitions, 1417 flow [2024-11-10 18:04:30,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 177 transitions, 1378 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 18:04:30,421 INFO L231 Difference]: Finished difference. Result has 143 places, 162 transitions, 1123 flow [2024-11-10 18:04:30,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=937, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1123, PETRI_PLACES=143, PETRI_TRANSITIONS=162} [2024-11-10 18:04:30,422 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-10 18:04:30,422 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 162 transitions, 1123 flow [2024-11-10 18:04:30,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 18:04:30,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:04:30,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:30,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-10 18:04:30,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:30,624 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-10 18:04:30,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:04:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1624583550, now seen corresponding path program 1 times [2024-11-10 18:04:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:04:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502234410] [2024-11-10 18:04:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:04:30,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:30,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:04:30,628 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:04:30,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-10 18:04:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:04:30,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:04:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:04:31,047 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-10 18:04:31,048 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:04:31,049 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-10 18:04:31,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-10 18:04:31,052 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-10 18:04:31,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-10 18:04:31,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-10 18:04:31,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-10 18:04:31,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (34 of 55 remaining) [2024-11-10 18:04:31,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-10 18:04:31,053 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-10 18:04:31,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-10 18:04:31,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-10 18:04:31,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-11-10 18:04:31,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-11-10 18:04:31,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-11-10 18:04:31,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-11-10 18:04:31,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-10 18:04:31,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-10 18:04:31,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-10 18:04:31,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-10 18:04:31,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-10 18:04:31,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-10 18:04:31,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-10 18:04:31,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-10 18:04:31,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-10 18:04:31,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-10 18:04:31,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-10 18:04:31,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-10 18:04:31,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-10 18:04:31,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-10 18:04:31,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-10 18:04:31,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-10 18:04:31,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-10 18:04:31,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-10 18:04:31,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-10 18:04:31,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-10 18:04:31,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 18:04:31,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:04:31,261 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:04:31,298 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:04:31,298 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:04:31,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:04:31 BasicIcfg [2024-11-10 18:04:31,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:04:31,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:04:31,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:04:31,304 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:04:31,304 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:03:50" (3/4) ... [2024-11-10 18:04:31,306 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:04:31,307 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:04:31,308 INFO L158 Benchmark]: Toolchain (without parser) took 43360.00ms. Allocated memory was 71.3MB in the beginning and 3.6GB in the end (delta: 3.6GB). Free memory was 47.6MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-10 18:04:31,308 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 46.1MB. Free memory is still 26.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:04:31,308 INFO L158 Benchmark]: CACSL2BoogieTranslator took 807.20ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.4MB in the beginning and 53.0MB in the end (delta: -5.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-10 18:04:31,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.42ms. Allocated memory is still 90.2MB. Free memory was 53.0MB in the beginning and 50.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:04:31,309 INFO L158 Benchmark]: Boogie Preprocessor took 96.03ms. Allocated memory is still 90.2MB. Free memory was 50.0MB in the beginning and 45.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:04:31,309 INFO L158 Benchmark]: IcfgBuilder took 1350.80ms. Allocated memory is still 90.2MB. Free memory was 45.2MB in the beginning and 35.2MB in the end (delta: 10.0MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-10 18:04:31,309 INFO L158 Benchmark]: TraceAbstraction took 41010.46ms. Allocated memory was 90.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 34.5MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-10 18:04:31,311 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 3.6GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:04:31,312 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.17ms. Allocated memory is still 46.1MB. Free memory is still 26.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 807.20ms. Allocated memory was 71.3MB in the beginning and 90.2MB in the end (delta: 18.9MB). Free memory was 47.4MB in the beginning and 53.0MB in the end (delta: -5.6MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.42ms. Allocated memory is still 90.2MB. Free memory was 53.0MB in the beginning and 50.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.03ms. Allocated memory is still 90.2MB. Free memory was 50.0MB in the beginning and 45.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1350.80ms. Allocated memory is still 90.2MB. Free memory was 45.2MB in the beginning and 35.2MB in the end (delta: 10.0MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 41010.46ms. Allocated memory was 90.2MB in the beginning and 3.6GB in the end (delta: 3.5GB). Free memory was 34.5MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 3.6GB. Free memory is still 2.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, d={-2147483648:24}, data={-2147483648: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)={-2147483648:24}, \old(data)={-2147483648:0}, arg={-2147483648:24}, d={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, \result=0, arg={-2147483648:24}, d={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, res=0, t1=0, t2=1] [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, status={3:0}, t1=0, t2=1] [L3940] 0 data->shared.a = 3 VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] [L3943] 0 data->shared.b = 3 VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] [L3946] EXPR 0 data->shared.a [L3946] 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_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648: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: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 131 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 40.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 32.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2353 SdHoareTripleChecker+Valid, 12.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1916 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5352 IncrementalHoareTripleChecker+Invalid, 5449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 99 mSDtfsCounter, 5352 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1123occurred in iteration=17, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 160 ConstructedInterpolants, 1 QuantifiedInterpolants, 1420 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1694 ConjunctsInSsa, 173 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 18:04:31,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample