./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_5-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_5-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:37,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:37,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:37:37,494 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:37,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:37,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:37,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:37,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:37,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:37,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:37,525 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:37,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:37,526 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:37,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:37,528 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:37,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:37,529 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:37,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:37,529 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:37,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:37,530 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:37,533 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:37,533 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:37,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:37,534 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:37,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:37,534 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:37,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:37,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:37,535 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:37,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:37,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:37,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:37,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:37,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:37,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:37,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:37:37,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:37:37,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:37,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:37,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:37,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:37,538 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-11-09 10:37:37,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:37,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:37,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:37,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:37,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:37,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-09 10:37:39,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:39,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:39,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-09 10:37:39,408 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d6cce7f/755d46a45ba941e9a5271a64378dbbef/FLAGe0827a6c1 [2024-11-09 10:37:39,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99d6cce7f/755d46a45ba941e9a5271a64378dbbef [2024-11-09 10:37:39,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:39,706 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:39,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:39,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:39,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:39,713 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:39" (1/1) ... [2024-11-09 10:37:39,714 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ad4489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:39, skipping insertion in model container [2024-11-09 10:37:39,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:39" (1/1) ... [2024-11-09 10:37:39,817 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:40,184 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:40,199 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:40,208 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:40,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:40,237 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 10:37:40,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c38281e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:40, skipping insertion in model container [2024-11-09 10:37:40,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:40,239 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:37:40,240 INFO L158 Benchmark]: Toolchain (without parser) took 533.08ms. Allocated memory is still 172.0MB. Free memory was 97.3MB in the beginning and 128.7MB in the end (delta: -31.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 10:37:40,241 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 172.0MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:37:40,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.09ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 128.7MB in the end (delta: -31.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 10:37:40,243 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.16ms. Allocated memory is still 172.0MB. Free memory is still 130.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.09ms. Allocated memory is still 172.0MB. Free memory was 97.1MB in the beginning and 128.7MB in the end (delta: -31.6MB). Peak memory consumption was 14.7MB. 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_5-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:37:42,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:37:42,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:37:42,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:37:42,098 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:37:42,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:37:42,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:37:42,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:37:42,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:37:42,141 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:37:42,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:37:42,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:37:42,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:37:42,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:37:42,142 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:37:42,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:37:42,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:37:42,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:37:42,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:37:42,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:37:42,146 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:37:42,147 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:37:42,147 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:37:42,147 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:37:42,147 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:37:42,148 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:37:42,148 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:37:42,148 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:37:42,148 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:37:42,148 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:37:42,148 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:37:42,149 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:37:42,149 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:37:42,149 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:37:42,149 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:37:42,150 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:42,150 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:37:42,150 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:37:42,150 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:37:42,150 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:37:42,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:37:42,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:37:42,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:37:42,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:37:42,154 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c93f158b090fed5438343046820ebde54acd91fe2fe757fc7dc28475dc42a7e [2024-11-09 10:37:42,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:37:42,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:37:42,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:37:42,420 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:37:42,420 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:37:42,421 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-09 10:37:43,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:37:44,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:37:44,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_5-container_of.i [2024-11-09 10:37:44,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b5396e3/aa87b58328c24a6ab14fe471532f2f5d/FLAG00a8e8dcc [2024-11-09 10:37:44,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5b5396e3/aa87b58328c24a6ab14fe471532f2f5d [2024-11-09 10:37:44,054 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:37:44,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:37:44,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:44,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:37:44,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:37:44,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,064 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f071dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44, skipping insertion in model container [2024-11-09 10:37:44,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,126 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:44,518 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:44,536 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:44,545 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:44,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:44,577 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:37:44,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:37:44,607 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:44,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:44,614 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:37:44,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:44,632 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:37:44,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:37:44,747 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:37:44,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44 WrapperNode [2024-11-09 10:37:44,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:37:44,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:44,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:37:44,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:37:44,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,815 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-11-09 10:37:44,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:37:44,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:37:44,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:37:44,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:37:44,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,855 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 2, 15]. 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, 2, 8]. [2024-11-09 10:37:44,855 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,871 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,879 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:37:44,886 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:37:44,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:37:44,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:37:44,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (1/1) ... [2024-11-09 10:37:44,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:37:44,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:37:44,927 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:37:44,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:37:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:37:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:37:44,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-09 10:37:44,969 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:37:44,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 10:37:44,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:37:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:37:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:37:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:37:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:37:44,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:37:44,972 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:37:45,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:37:45,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:37:45,716 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:37:45,717 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:37:45,868 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:37:45,869 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 10:37:45,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:45 BoogieIcfgContainer [2024-11-09 10:37:45,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:37:45,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:37:45,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:37:45,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:37:45,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:37:44" (1/3) ... [2024-11-09 10:37:45,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500b514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:45, skipping insertion in model container [2024-11-09 10:37:45,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:37:44" (2/3) ... [2024-11-09 10:37:45,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500b514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:37:45, skipping insertion in model container [2024-11-09 10:37:45,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:45" (3/3) ... [2024-11-09 10:37:45,878 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-11-09 10:37:45,891 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:37:45,891 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-09 10:37:45,891 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:37:45,974 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:37:46,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-11-09 10:37:46,056 INFO L124 PetriNetUnfolderBase]: 14/157 cut-off events. [2024-11-09 10:37:46,057 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:37:46,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 14/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 501 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-09 10:37:46,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-11-09 10:37:46,067 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-11-09 10:37:46,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:37:46,080 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;@174eebc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:37:46,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-09 10:37:46,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:37:46,083 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-09 10:37:46,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:37:46,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:46,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:37:46,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:46,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:46,089 INFO L85 PathProgramCache]: Analyzing trace with hash 561254, now seen corresponding path program 1 times [2024-11-09 10:37:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67624875] [2024-11-09 10:37:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:46,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:46,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:46,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:46,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 10:37:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:46,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:46,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:46,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:37:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:46,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:46,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67624875] [2024-11-09 10:37:46,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67624875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:46,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:46,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:46,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973605296] [2024-11-09 10:37:46,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:46,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:46,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:46,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-09 10:37:46,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:46,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:46,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-09 10:37:46,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:47,808 INFO L124 PetriNetUnfolderBase]: 4409/10835 cut-off events. [2024-11-09 10:37:47,808 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-09 10:37:47,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17919 conditions, 10835 events. 4409/10835 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 111305 event pairs, 559 based on Foata normal form. 792/8156 useless extension candidates. Maximal degree in co-relation 16922. Up to 6052 conditions per place. [2024-11-09 10:37:47,866 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-11-09 10:37:47,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 472 flow [2024-11-09 10:37:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 226 transitions. [2024-11-09 10:37:47,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2024-11-09 10:37:47,878 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 226 transitions. [2024-11-09 10:37:47,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 472 flow [2024-11-09 10:37:47,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 464 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:37:47,886 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-09 10:37:47,887 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-09 10:37:47,890 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-11-09 10:37:47,890 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-09 10:37:47,890 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-09 10:37:47,891 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:47,891 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:37:47,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 10:37:48,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:48,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:48,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash 561255, now seen corresponding path program 1 times [2024-11-09 10:37:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:48,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362459932] [2024-11-09 10:37:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:48,096 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:48,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:48,098 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:48,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 10:37:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:48,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:37:48,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:48,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:37:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:48,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:48,219 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362459932] [2024-11-09 10:37:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362459932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:48,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:48,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781229238] [2024-11-09 10:37:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:48,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:48,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:48,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-09 10:37:48,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:48,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:48,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-09 10:37:48,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:49,312 INFO L124 PetriNetUnfolderBase]: 4409/10833 cut-off events. [2024-11-09 10:37:49,312 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-09 10:37:49,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18083 conditions, 10833 events. 4409/10833 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 111595 event pairs, 559 based on Foata normal form. 1/7363 useless extension candidates. Maximal degree in co-relation 1994. Up to 6052 conditions per place. [2024-11-09 10:37:49,365 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-11-09 10:37:49,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 462 flow [2024-11-09 10:37:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-11-09 10:37:49,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-11-09 10:37:49,368 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 220 transitions. [2024-11-09 10:37:49,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 462 flow [2024-11-09 10:37:49,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:49,374 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-11-09 10:37:49,375 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-09 10:37:49,375 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-09 10:37:49,376 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-11-09 10:37:49,376 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-09 10:37:49,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:49,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:37:49,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 10:37:49,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:49,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:49,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 17397141, now seen corresponding path program 1 times [2024-11-09 10:37:49,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:49,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814743675] [2024-11-09 10:37:49,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:49,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:49,581 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:49,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 10:37:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:49,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:37:49,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:49,667 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:49,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:49,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814743675] [2024-11-09 10:37:49,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814743675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:49,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:49,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:49,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274270646] [2024-11-09 10:37:49,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:49,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:49,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:49,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:49,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:49,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-09 10:37:49,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:49,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:49,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-09 10:37:49,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:50,456 INFO L124 PetriNetUnfolderBase]: 4408/8077 cut-off events. [2024-11-09 10:37:50,456 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-11-09 10:37:50,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15327 conditions, 8077 events. 4408/8077 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 62053 event pairs, 4043 based on Foata normal form. 1/5576 useless extension candidates. Maximal degree in co-relation 7647. Up to 6473 conditions per place. [2024-11-09 10:37:50,488 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 93 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-09 10:37:50,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 460 flow [2024-11-09 10:37:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 222 transitions. [2024-11-09 10:37:50,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5967741935483871 [2024-11-09 10:37:50,491 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 222 transitions. [2024-11-09 10:37:50,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 460 flow [2024-11-09 10:37:50,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:50,494 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-11-09 10:37:50,494 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-09 10:37:50,495 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-09 10:37:50,495 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-11-09 10:37:50,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:50,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:50,496 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:50,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 10:37:50,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:50,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:50,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1675627661, now seen corresponding path program 1 times [2024-11-09 10:37:50,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:50,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305655782] [2024-11-09 10:37:50,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:50,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:50,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:50,703 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:50,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 10:37:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:50,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:37:50,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:50,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:37:50,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:50,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:50,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:50,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305655782] [2024-11-09 10:37:50,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305655782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:50,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:50,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:50,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749677785] [2024-11-09 10:37:50,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:50,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:50,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:50,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:50,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:50,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-11-09 10:37:50,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:50,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:50,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-11-09 10:37:50,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:51,849 INFO L124 PetriNetUnfolderBase]: 5136/9326 cut-off events. [2024-11-09 10:37:51,850 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-11-09 10:37:51,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17699 conditions, 9326 events. 5136/9326 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 71026 event pairs, 4407 based on Foata normal form. 0/6615 useless extension candidates. Maximal degree in co-relation 16374. Up to 7032 conditions per place. [2024-11-09 10:37:51,903 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 94 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2024-11-09 10:37:51,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 126 transitions, 456 flow [2024-11-09 10:37:51,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:51,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2024-11-09 10:37:51,906 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-11-09 10:37:51,906 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 3 states and 208 transitions. [2024-11-09 10:37:51,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 126 transitions, 456 flow [2024-11-09 10:37:51,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 126 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:51,923 INFO L231 Difference]: Finished difference. Result has 103 places, 100 transitions, 212 flow [2024-11-09 10:37:51,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=103, PETRI_TRANSITIONS=100} [2024-11-09 10:37:51,924 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -15 predicate places. [2024-11-09 10:37:51,924 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 100 transitions, 212 flow [2024-11-09 10:37:51,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:51,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:51,924 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:51,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 10:37:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:52,125 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:52,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1675627662, now seen corresponding path program 1 times [2024-11-09 10:37:52,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:52,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1424660982] [2024-11-09 10:37:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:52,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:52,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:52,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:52,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:37:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:52,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:37:52,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:52,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:37:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:52,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:52,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:52,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1424660982] [2024-11-09 10:37:52,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1424660982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:52,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:52,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:37:52,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860131681] [2024-11-09 10:37:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:52,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:37:52,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:37:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:37:52,352 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 124 [2024-11-09 10:37:52,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 100 transitions, 212 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:52,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:52,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 124 [2024-11-09 10:37:52,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:53,088 INFO L124 PetriNetUnfolderBase]: 4408/8143 cut-off events. [2024-11-09 10:37:53,088 INFO L125 PetriNetUnfolderBase]: For 198/198 co-relation queries the response was YES. [2024-11-09 10:37:53,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15409 conditions, 8143 events. 4408/8143 cut-off events. For 198/198 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 62979 event pairs, 3107 based on Foata normal form. 394/6163 useless extension candidates. Maximal degree in co-relation 12508. Up to 4910 conditions per place. [2024-11-09 10:37:53,127 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 105 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2024-11-09 10:37:53,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 133 transitions, 496 flow [2024-11-09 10:37:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:37:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:37:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 223 transitions. [2024-11-09 10:37:53,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5994623655913979 [2024-11-09 10:37:53,129 INFO L175 Difference]: Start difference. First operand has 103 places, 100 transitions, 212 flow. Second operand 3 states and 223 transitions. [2024-11-09 10:37:53,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 133 transitions, 496 flow [2024-11-09 10:37:53,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 133 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:37:53,143 INFO L231 Difference]: Finished difference. Result has 104 places, 101 transitions, 225 flow [2024-11-09 10:37:53,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=104, PETRI_TRANSITIONS=101} [2024-11-09 10:37:53,145 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -14 predicate places. [2024-11-09 10:37:53,146 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 101 transitions, 225 flow [2024-11-09 10:37:53,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:53,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:53,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:53,152 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-09 10:37:53,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:53,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:53,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:53,352 INFO L85 PathProgramCache]: Analyzing trace with hash 480476947, now seen corresponding path program 1 times [2024-11-09 10:37:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105558224] [2024-11-09 10:37:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:53,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:53,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:53,358 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:53,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:37:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:53,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:37:53,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:53,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:37:53,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:53,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:53,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:53,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105558224] [2024-11-09 10:37:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105558224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:53,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449862071] [2024-11-09 10:37:53,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:53,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:53,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:53,669 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:37:53,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 101 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:53,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:53,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:37:53,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:54,591 INFO L124 PetriNetUnfolderBase]: 3844/8036 cut-off events. [2024-11-09 10:37:54,591 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-11-09 10:37:54,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14925 conditions, 8036 events. 3844/8036 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 68062 event pairs, 55 based on Foata normal form. 0/6221 useless extension candidates. Maximal degree in co-relation 9104. Up to 3713 conditions per place. [2024-11-09 10:37:54,625 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 169 selfloop transitions, 13 changer transitions 1/214 dead transitions. [2024-11-09 10:37:54,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 214 transitions, 830 flow [2024-11-09 10:37:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:37:54,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:37:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 534 transitions. [2024-11-09 10:37:54,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5383064516129032 [2024-11-09 10:37:54,627 INFO L175 Difference]: Start difference. First operand has 104 places, 101 transitions, 225 flow. Second operand 8 states and 534 transitions. [2024-11-09 10:37:54,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 214 transitions, 830 flow [2024-11-09 10:37:54,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 214 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:37:54,638 INFO L231 Difference]: Finished difference. Result has 114 places, 110 transitions, 313 flow [2024-11-09 10:37:54,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=313, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2024-11-09 10:37:54,639 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -4 predicate places. [2024-11-09 10:37:54,639 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 313 flow [2024-11-09 10:37:54,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:54,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:54,639 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:54,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:37:54,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:54,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:54,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash 480476948, now seen corresponding path program 1 times [2024-11-09 10:37:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744124469] [2024-11-09 10:37:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:54,845 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:54,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 10:37:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:54,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:37:54,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:54,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:37:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:55,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:55,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:55,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744124469] [2024-11-09 10:37:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744124469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:55,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:55,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066090935] [2024-11-09 10:37:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:55,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:55,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:55,186 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:37:55,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:55,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:55,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:37:55,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:56,041 INFO L124 PetriNetUnfolderBase]: 2867/6073 cut-off events. [2024-11-09 10:37:56,041 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-11-09 10:37:56,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12538 conditions, 6073 events. 2867/6073 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 48858 event pairs, 125 based on Foata normal form. 524/5654 useless extension candidates. Maximal degree in co-relation 11075. Up to 3099 conditions per place. [2024-11-09 10:37:56,071 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 151 selfloop transitions, 10 changer transitions 2/194 dead transitions. [2024-11-09 10:37:56,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 194 transitions, 827 flow [2024-11-09 10:37:56,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:37:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:37:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 465 transitions. [2024-11-09 10:37:56,079 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-11-09 10:37:56,080 INFO L175 Difference]: Start difference. First operand has 114 places, 110 transitions, 313 flow. Second operand 7 states and 465 transitions. [2024-11-09 10:37:56,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 194 transitions, 827 flow [2024-11-09 10:37:56,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 194 transitions, 827 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 10:37:56,098 INFO L231 Difference]: Finished difference. Result has 123 places, 112 transitions, 366 flow [2024-11-09 10:37:56,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=123, PETRI_TRANSITIONS=112} [2024-11-09 10:37:56,098 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 5 predicate places. [2024-11-09 10:37:56,099 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 112 transitions, 366 flow [2024-11-09 10:37:56,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:56,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:56,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:56,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 10:37:56,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:56,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:56,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash 458561999, now seen corresponding path program 1 times [2024-11-09 10:37:56,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:56,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911760684] [2024-11-09 10:37:56,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:56,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:56,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 10:37:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:56,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:37:56,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:56,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:37:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:56,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:56,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:56,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911760684] [2024-11-09 10:37:56,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911760684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:56,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:56,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:56,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317919009] [2024-11-09 10:37:56,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:56,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:56,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:56,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:56,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:56,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:37:56,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 112 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:56,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:56,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:37:56,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:57,500 INFO L124 PetriNetUnfolderBase]: 2636/5484 cut-off events. [2024-11-09 10:37:57,501 INFO L125 PetriNetUnfolderBase]: For 3778/3778 co-relation queries the response was YES. [2024-11-09 10:37:57,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12310 conditions, 5484 events. 2636/5484 cut-off events. For 3778/3778 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 42612 event pairs, 191 based on Foata normal form. 0/4807 useless extension candidates. Maximal degree in co-relation 10986. Up to 2221 conditions per place. [2024-11-09 10:37:57,530 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 174 selfloop transitions, 17 changer transitions 0/222 dead transitions. [2024-11-09 10:37:57,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 222 transitions, 1105 flow [2024-11-09 10:37:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:37:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:37:57,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 530 transitions. [2024-11-09 10:37:57,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5342741935483871 [2024-11-09 10:37:57,534 INFO L175 Difference]: Start difference. First operand has 123 places, 112 transitions, 366 flow. Second operand 8 states and 530 transitions. [2024-11-09 10:37:57,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 222 transitions, 1105 flow [2024-11-09 10:37:57,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 222 transitions, 1075 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 10:37:57,545 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 469 flow [2024-11-09 10:37:57,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=469, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2024-11-09 10:37:57,546 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2024-11-09 10:37:57,546 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 469 flow [2024-11-09 10:37:57,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:57,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:57,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:57,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:57,747 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:57,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 458562000, now seen corresponding path program 1 times [2024-11-09 10:37:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:57,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627042835] [2024-11-09 10:37:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:57,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:57,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:57,751 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:57,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 10:37:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:57,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:37:57,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:57,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:37:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:37:57,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:57,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:57,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627042835] [2024-11-09 10:37:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627042835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:57,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:37:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207483535] [2024-11-09 10:37:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:57,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:57,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:57,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:58,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:37:58,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:58,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:58,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:37:58,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:37:58,921 INFO L124 PetriNetUnfolderBase]: 1987/4195 cut-off events. [2024-11-09 10:37:58,921 INFO L125 PetriNetUnfolderBase]: For 4454/4456 co-relation queries the response was YES. [2024-11-09 10:37:58,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10529 conditions, 4195 events. 1987/4195 cut-off events. For 4454/4456 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 30960 event pairs, 384 based on Foata normal form. 378/4449 useless extension candidates. Maximal degree in co-relation 9449. Up to 2291 conditions per place. [2024-11-09 10:37:58,935 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 145 selfloop transitions, 14 changer transitions 1/191 dead transitions. [2024-11-09 10:37:58,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 191 transitions, 1027 flow [2024-11-09 10:37:58,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:37:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:37:58,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 448 transitions. [2024-11-09 10:37:58,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5161290322580645 [2024-11-09 10:37:58,938 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 469 flow. Second operand 7 states and 448 transitions. [2024-11-09 10:37:58,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 191 transitions, 1027 flow [2024-11-09 10:37:58,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 191 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:37:58,952 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 540 flow [2024-11-09 10:37:58,954 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2024-11-09 10:37:58,954 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2024-11-09 10:37:58,954 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 540 flow [2024-11-09 10:37:58,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:58,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:37:58,955 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:37:58,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:37:59,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:59,156 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:37:59,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:37:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1841625201, now seen corresponding path program 1 times [2024-11-09 10:37:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:37:59,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730353745] [2024-11-09 10:37:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:37:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:37:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:37:59,162 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:37:59,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 10:37:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:37:59,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:37:59,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:37:59,336 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:59,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:59,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:59,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2024-11-09 10:37:59,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:59,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:59,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:37:59,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:59,392 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-09 10:37:59,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:37:59,489 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-09 10:37:59,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-09 10:37:59,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:37:59,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:37:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730353745] [2024-11-09 10:37:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730353745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:37:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:37:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:37:59,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382539196] [2024-11-09 10:37:59,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:37:59,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:37:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:37:59,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:37:59,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:37:59,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-09 10:37:59,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:37:59,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:37:59,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-09 10:37:59,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:01,994 INFO L124 PetriNetUnfolderBase]: 2833/5364 cut-off events. [2024-11-09 10:38:01,994 INFO L125 PetriNetUnfolderBase]: For 9062/9066 co-relation queries the response was YES. [2024-11-09 10:38:02,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14860 conditions, 5364 events. 2833/5364 cut-off events. For 9062/9066 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 38454 event pairs, 1545 based on Foata normal form. 244/5468 useless extension candidates. Maximal degree in co-relation 13301. Up to 3777 conditions per place. [2024-11-09 10:38:02,020 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 136 selfloop transitions, 27 changer transitions 0/191 dead transitions. [2024-11-09 10:38:02,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 191 transitions, 1156 flow [2024-11-09 10:38:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:38:02,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:38:02,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 379 transitions. [2024-11-09 10:38:02,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5094086021505376 [2024-11-09 10:38:02,022 INFO L175 Difference]: Start difference. First operand has 137 places, 124 transitions, 540 flow. Second operand 6 states and 379 transitions. [2024-11-09 10:38:02,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 191 transitions, 1156 flow [2024-11-09 10:38:02,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 191 transitions, 1131 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 10:38:02,035 INFO L231 Difference]: Finished difference. Result has 141 places, 151 transitions, 788 flow [2024-11-09 10:38:02,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=141, PETRI_TRANSITIONS=151} [2024-11-09 10:38:02,037 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-11-09 10:38:02,037 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 151 transitions, 788 flow [2024-11-09 10:38:02,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.2) internal successors, (211), 5 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:02,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:02,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:02,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:02,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:02,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash -2028696617, now seen corresponding path program 1 times [2024-11-09 10:38:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:02,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1495615583] [2024-11-09 10:38:02,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:02,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:02,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:02,242 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:02,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 10:38:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:02,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:38:02,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:02,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:38:02,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:38:02,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:02,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:38:02,608 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:02,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:38:02,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:02,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:02,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:02,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1495615583] [2024-11-09 10:38:02,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1495615583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:02,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:02,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:02,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256839625] [2024-11-09 10:38:02,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:02,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:02,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:03,091 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:38:03,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 151 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:03,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:03,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:38:03,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:04,417 INFO L124 PetriNetUnfolderBase]: 2928/5803 cut-off events. [2024-11-09 10:38:04,417 INFO L125 PetriNetUnfolderBase]: For 10435/10441 co-relation queries the response was YES. [2024-11-09 10:38:04,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17915 conditions, 5803 events. 2928/5803 cut-off events. For 10435/10441 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 43896 event pairs, 607 based on Foata normal form. 39/5718 useless extension candidates. Maximal degree in co-relation 16083. Up to 2515 conditions per place. [2024-11-09 10:38:04,447 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 195 selfloop transitions, 24 changer transitions 0/251 dead transitions. [2024-11-09 10:38:04,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 251 transitions, 1673 flow [2024-11-09 10:38:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:38:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:38:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 557 transitions. [2024-11-09 10:38:04,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49910394265232977 [2024-11-09 10:38:04,450 INFO L175 Difference]: Start difference. First operand has 141 places, 151 transitions, 788 flow. Second operand 9 states and 557 transitions. [2024-11-09 10:38:04,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 251 transitions, 1673 flow [2024-11-09 10:38:04,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 251 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:04,482 INFO L231 Difference]: Finished difference. Result has 145 places, 149 transitions, 827 flow [2024-11-09 10:38:04,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=827, PETRI_PLACES=145, PETRI_TRANSITIONS=149} [2024-11-09 10:38:04,483 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-11-09 10:38:04,483 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 149 transitions, 827 flow [2024-11-09 10:38:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:04,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:04,483 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:04,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:04,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:04,684 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:04,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -31356965, now seen corresponding path program 1 times [2024-11-09 10:38:04,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:04,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989107532] [2024-11-09 10:38:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:04,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:04,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:04,687 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:04,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 10:38:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:04,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:38:04,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:04,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:38:04,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:38:04,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:04,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:38:04,985 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:04,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:38:05,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:05,009 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:05,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:05,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989107532] [2024-11-09 10:38:05,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989107532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:05,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:05,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:38:05,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962239052] [2024-11-09 10:38:05,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:05,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:38:05,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:05,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:38:05,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:38:05,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:38:05,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 149 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:05,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:05,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:38:05,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:06,598 INFO L124 PetriNetUnfolderBase]: 3340/6550 cut-off events. [2024-11-09 10:38:06,598 INFO L125 PetriNetUnfolderBase]: For 13997/14001 co-relation queries the response was YES. [2024-11-09 10:38:06,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20566 conditions, 6550 events. 3340/6550 cut-off events. For 13997/14001 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 50933 event pairs, 883 based on Foata normal form. 76/6535 useless extension candidates. Maximal degree in co-relation 17640. Up to 2361 conditions per place. [2024-11-09 10:38:06,629 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 213 selfloop transitions, 24 changer transitions 0/269 dead transitions. [2024-11-09 10:38:06,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 269 transitions, 1822 flow [2024-11-09 10:38:06,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:38:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:38:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 572 transitions. [2024-11-09 10:38:06,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5125448028673835 [2024-11-09 10:38:06,631 INFO L175 Difference]: Start difference. First operand has 145 places, 149 transitions, 827 flow. Second operand 9 states and 572 transitions. [2024-11-09 10:38:06,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 269 transitions, 1822 flow [2024-11-09 10:38:06,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 269 transitions, 1770 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:38:06,669 INFO L231 Difference]: Finished difference. Result has 143 places, 147 transitions, 831 flow [2024-11-09 10:38:06,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=831, PETRI_PLACES=143, PETRI_TRANSITIONS=147} [2024-11-09 10:38:06,669 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-09 10:38:06,669 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 147 transitions, 831 flow [2024-11-09 10:38:06,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:06,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:06,670 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:06,677 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-09 10:38:06,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:06,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:06,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:06,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1783923114, now seen corresponding path program 1 times [2024-11-09 10:38:06,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:06,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480156246] [2024-11-09 10:38:06,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:06,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:06,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:06,872 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:06,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 10:38:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:07,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:38:07,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:07,154 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#data~1#1.base_89| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#data~1#1.base_89| (_ bv0 1))))) is different from true [2024-11-09 10:38:07,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:07,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:07,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:07,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480156246] [2024-11-09 10:38:07,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480156246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:07,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:07,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468957168] [2024-11-09 10:38:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:38:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:38:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2024-11-09 10:38:07,161 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 124 [2024-11-09 10:38:07,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 147 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:07,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:07,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 124 [2024-11-09 10:38:07,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:08,138 INFO L124 PetriNetUnfolderBase]: 3630/6717 cut-off events. [2024-11-09 10:38:08,138 INFO L125 PetriNetUnfolderBase]: For 16275/16277 co-relation queries the response was YES. [2024-11-09 10:38:08,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22018 conditions, 6717 events. 3630/6717 cut-off events. For 16275/16277 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 49758 event pairs, 1548 based on Foata normal form. 1/6615 useless extension candidates. Maximal degree in co-relation 19043. Up to 2794 conditions per place. [2024-11-09 10:38:08,171 INFO L140 encePairwiseOnDemand]: 98/124 looper letters, 138 selfloop transitions, 37 changer transitions 4/197 dead transitions. [2024-11-09 10:38:08,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 197 transitions, 1422 flow [2024-11-09 10:38:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:38:08,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:38:08,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2024-11-09 10:38:08,172 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4032258064516129 [2024-11-09 10:38:08,172 INFO L175 Difference]: Start difference. First operand has 143 places, 147 transitions, 831 flow. Second operand 5 states and 250 transitions. [2024-11-09 10:38:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 197 transitions, 1422 flow [2024-11-09 10:38:08,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 197 transitions, 1387 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:38:08,219 INFO L231 Difference]: Finished difference. Result has 144 places, 165 transitions, 1083 flow [2024-11-09 10:38:08,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1083, PETRI_PLACES=144, PETRI_TRANSITIONS=165} [2024-11-09 10:38:08,219 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 26 predicate places. [2024-11-09 10:38:08,219 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 165 transitions, 1083 flow [2024-11-09 10:38:08,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:08,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:08,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:08,232 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-09 10:38:08,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:08,420 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:08,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash 714340402, now seen corresponding path program 1 times [2024-11-09 10:38:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:08,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284050758] [2024-11-09 10:38:08,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:08,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:08,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:08,423 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:08,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:38:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:08,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:38:08,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:08,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:38:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:08,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:08,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:08,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284050758] [2024-11-09 10:38:08,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284050758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:08,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455766720] [2024-11-09 10:38:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:08,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:08,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:08,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:08,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:08,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-09 10:38:08,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 165 transitions, 1083 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:08,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:08,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-09 10:38:08,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:09,378 INFO L124 PetriNetUnfolderBase]: 3428/6437 cut-off events. [2024-11-09 10:38:09,378 INFO L125 PetriNetUnfolderBase]: For 19141/19177 co-relation queries the response was YES. [2024-11-09 10:38:09,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24914 conditions, 6437 events. 3428/6437 cut-off events. For 19141/19177 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 48174 event pairs, 1949 based on Foata normal form. 17/6327 useless extension candidates. Maximal degree in co-relation 21739. Up to 5351 conditions per place. [2024-11-09 10:38:09,416 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 140 selfloop transitions, 5 changer transitions 0/175 dead transitions. [2024-11-09 10:38:09,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 175 transitions, 1425 flow [2024-11-09 10:38:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2024-11-09 10:38:09,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-11-09 10:38:09,417 INFO L175 Difference]: Start difference. First operand has 144 places, 165 transitions, 1083 flow. Second operand 3 states and 201 transitions. [2024-11-09 10:38:09,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 175 transitions, 1425 flow [2024-11-09 10:38:09,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 175 transitions, 1344 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-11-09 10:38:09,486 INFO L231 Difference]: Finished difference. Result has 140 places, 163 transitions, 1008 flow [2024-11-09 10:38:09,486 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=998, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1008, PETRI_PLACES=140, PETRI_TRANSITIONS=163} [2024-11-09 10:38:09,487 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 22 predicate places. [2024-11-09 10:38:09,487 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 163 transitions, 1008 flow [2024-11-09 10:38:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:09,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:09,487 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:09,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 10:38:09,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:09,687 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:09,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:09,688 INFO L85 PathProgramCache]: Analyzing trace with hash 714340401, now seen corresponding path program 1 times [2024-11-09 10:38:09,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:09,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595591048] [2024-11-09 10:38:09,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:09,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:09,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:09,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 10:38:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:09,824 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:38:09,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:09,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:38:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:09,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:09,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:09,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595591048] [2024-11-09 10:38:09,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595591048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:09,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:09,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:09,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522817863] [2024-11-09 10:38:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:09,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:09,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:09,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:09,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:09,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-09 10:38:09,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 163 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:09,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:09,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-09 10:38:09,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:10,636 INFO L124 PetriNetUnfolderBase]: 3428/6420 cut-off events. [2024-11-09 10:38:10,636 INFO L125 PetriNetUnfolderBase]: For 17407/17467 co-relation queries the response was YES. [2024-11-09 10:38:10,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24527 conditions, 6420 events. 3428/6420 cut-off events. For 17407/17467 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 47355 event pairs, 1989 based on Foata normal form. 25/6318 useless extension candidates. Maximal degree in co-relation 23138. Up to 5351 conditions per place. [2024-11-09 10:38:10,666 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 140 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2024-11-09 10:38:10,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 173 transitions, 1350 flow [2024-11-09 10:38:10,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:10,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2024-11-09 10:38:10,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5403225806451613 [2024-11-09 10:38:10,668 INFO L175 Difference]: Start difference. First operand has 140 places, 163 transitions, 1008 flow. Second operand 3 states and 201 transitions. [2024-11-09 10:38:10,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 173 transitions, 1350 flow [2024-11-09 10:38:10,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 173 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:10,722 INFO L231 Difference]: Finished difference. Result has 138 places, 161 transitions, 1004 flow [2024-11-09 10:38:10,722 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1004, PETRI_PLACES=138, PETRI_TRANSITIONS=161} [2024-11-09 10:38:10,722 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 20 predicate places. [2024-11-09 10:38:10,722 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 161 transitions, 1004 flow [2024-11-09 10:38:10,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:10,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:10,723 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:10,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 10:38:10,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:10,923 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:10,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash 669716591, now seen corresponding path program 1 times [2024-11-09 10:38:10,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:10,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218789775] [2024-11-09 10:38:10,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:10,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:10,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:10,926 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:10,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 10:38:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:11,127 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:38:11,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:11,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:38:11,178 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:38:11,179 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-09 10:38:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:11,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:11,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:11,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218789775] [2024-11-09 10:38:11,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218789775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:11,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:11,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:11,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029962263] [2024-11-09 10:38:11,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:11,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:11,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:11,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:11,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:11,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 124 [2024-11-09 10:38:11,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 161 transitions, 1004 flow. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:11,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:11,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 124 [2024-11-09 10:38:11,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:12,490 INFO L124 PetriNetUnfolderBase]: 3595/6649 cut-off events. [2024-11-09 10:38:12,491 INFO L125 PetriNetUnfolderBase]: For 17746/17772 co-relation queries the response was YES. [2024-11-09 10:38:12,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25363 conditions, 6649 events. 3595/6649 cut-off events. For 17746/17772 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 48525 event pairs, 1868 based on Foata normal form. 9/6598 useless extension candidates. Maximal degree in co-relation 24131. Up to 3143 conditions per place. [2024-11-09 10:38:12,532 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 137 selfloop transitions, 18 changer transitions 0/179 dead transitions. [2024-11-09 10:38:12,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 179 transitions, 1406 flow [2024-11-09 10:38:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:12,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2024-11-09 10:38:12,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46975806451612906 [2024-11-09 10:38:12,534 INFO L175 Difference]: Start difference. First operand has 138 places, 161 transitions, 1004 flow. Second operand 4 states and 233 transitions. [2024-11-09 10:38:12,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 179 transitions, 1406 flow [2024-11-09 10:38:12,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 179 transitions, 1396 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:12,585 INFO L231 Difference]: Finished difference. Result has 135 places, 157 transitions, 1022 flow [2024-11-09 10:38:12,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1022, PETRI_PLACES=135, PETRI_TRANSITIONS=157} [2024-11-09 10:38:12,586 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2024-11-09 10:38:12,586 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 157 transitions, 1022 flow [2024-11-09 10:38:12,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:12,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:12,586 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:12,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:12,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:12,787 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:12,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash 669716592, now seen corresponding path program 1 times [2024-11-09 10:38:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:12,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309573844] [2024-11-09 10:38:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:12,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:12,789 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:12,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-09 10:38:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:13,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:38:13,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:13,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 10:38:13,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:38:13,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:13,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 10:38:13,131 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:38:13,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 10:38:13,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:13,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:13,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309573844] [2024-11-09 10:38:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309573844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:13,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:38:13,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908250402] [2024-11-09 10:38:13,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:13,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:13,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:13,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:13,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 124 [2024-11-09 10:38:13,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 157 transitions, 1022 flow. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:13,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:13,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 124 [2024-11-09 10:38:13,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:14,043 INFO L124 PetriNetUnfolderBase]: 3372/6308 cut-off events. [2024-11-09 10:38:14,044 INFO L125 PetriNetUnfolderBase]: For 19073/19133 co-relation queries the response was YES. [2024-11-09 10:38:14,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24399 conditions, 6308 events. 3372/6308 cut-off events. For 19073/19133 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 46665 event pairs, 1740 based on Foata normal form. 24/6268 useless extension candidates. Maximal degree in co-relation 21169. Up to 3035 conditions per place. [2024-11-09 10:38:14,085 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 142 selfloop transitions, 16 changer transitions 0/179 dead transitions. [2024-11-09 10:38:14,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 179 transitions, 1450 flow [2024-11-09 10:38:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:14,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:14,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 222 transitions. [2024-11-09 10:38:14,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4475806451612903 [2024-11-09 10:38:14,087 INFO L175 Difference]: Start difference. First operand has 135 places, 157 transitions, 1022 flow. Second operand 4 states and 222 transitions. [2024-11-09 10:38:14,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 179 transitions, 1450 flow [2024-11-09 10:38:14,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 179 transitions, 1414 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:14,153 INFO L231 Difference]: Finished difference. Result has 131 places, 153 transitions, 1010 flow [2024-11-09 10:38:14,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1010, PETRI_PLACES=131, PETRI_TRANSITIONS=153} [2024-11-09 10:38:14,153 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-09 10:38:14,153 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 153 transitions, 1010 flow [2024-11-09 10:38:14,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:14,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:14,154 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:14,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-09 10:38:14,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:14,355 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:14,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1847745221, now seen corresponding path program 1 times [2024-11-09 10:38:14,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:14,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338627625] [2024-11-09 10:38:14,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:14,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:14,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:14,358 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:14,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-09 10:38:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:14,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:38:14,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:14,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:14,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338627625] [2024-11-09 10:38:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338627625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:38:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946074257] [2024-11-09 10:38:14,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:14,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:38:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:14,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:38:14,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:38:14,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-09 10:38:14,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 153 transitions, 1010 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:14,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:14,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-09 10:38:14,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:14,819 INFO L124 PetriNetUnfolderBase]: 455/835 cut-off events. [2024-11-09 10:38:14,819 INFO L125 PetriNetUnfolderBase]: For 1426/1426 co-relation queries the response was YES. [2024-11-09 10:38:14,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2940 conditions, 835 events. 455/835 cut-off events. For 1426/1426 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3408 event pairs, 63 based on Foata normal form. 64/881 useless extension candidates. Maximal degree in co-relation 2917. Up to 484 conditions per place. [2024-11-09 10:38:14,823 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 75 selfloop transitions, 6 changer transitions 0/103 dead transitions. [2024-11-09 10:38:14,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 103 transitions, 623 flow [2024-11-09 10:38:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:38:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:38:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 242 transitions. [2024-11-09 10:38:14,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4879032258064516 [2024-11-09 10:38:14,824 INFO L175 Difference]: Start difference. First operand has 131 places, 153 transitions, 1010 flow. Second operand 4 states and 242 transitions. [2024-11-09 10:38:14,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 103 transitions, 623 flow [2024-11-09 10:38:14,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 103 transitions, 478 flow, removed 25 selfloop flow, removed 26 redundant places. [2024-11-09 10:38:14,829 INFO L231 Difference]: Finished difference. Result has 89 places, 77 transitions, 234 flow [2024-11-09 10:38:14,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=89, PETRI_TRANSITIONS=77} [2024-11-09 10:38:14,830 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -29 predicate places. [2024-11-09 10:38:14,830 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 77 transitions, 234 flow [2024-11-09 10:38:14,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:14,830 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:14,830 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:14,836 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 (19)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:15,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:15,031 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:15,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:15,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2090228439, now seen corresponding path program 1 times [2024-11-09 10:38:15,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:15,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548764217] [2024-11-09 10:38:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:15,033 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:15,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-09 10:38:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:15,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:38:15,276 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:15,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:15,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:15,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:15,283 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:15,285 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-09 10:38:15,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:38:15,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 53 [2024-11-09 10:38:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:15,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:15,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:15,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548764217] [2024-11-09 10:38:15,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548764217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:15,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660443368] [2024-11-09 10:38:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:15,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:15,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-09 10:38:15,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 77 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:15,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:15,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-09 10:38:15,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:15,721 INFO L124 PetriNetUnfolderBase]: 468/874 cut-off events. [2024-11-09 10:38:15,721 INFO L125 PetriNetUnfolderBase]: For 713/713 co-relation queries the response was YES. [2024-11-09 10:38:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 874 events. 468/874 cut-off events. For 713/713 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3408 event pairs, 382 based on Foata normal form. 0/851 useless extension candidates. Maximal degree in co-relation 2432. Up to 777 conditions per place. [2024-11-09 10:38:15,724 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 66 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2024-11-09 10:38:15,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 417 flow [2024-11-09 10:38:15,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:15,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:15,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2024-11-09 10:38:15,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.489247311827957 [2024-11-09 10:38:15,725 INFO L175 Difference]: Start difference. First operand has 89 places, 77 transitions, 234 flow. Second operand 3 states and 182 transitions. [2024-11-09 10:38:15,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 417 flow [2024-11-09 10:38:15,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 90 transitions, 405 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:15,727 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 266 flow [2024-11-09 10:38:15,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2024-11-09 10:38:15,727 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -28 predicate places. [2024-11-09 10:38:15,727 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 266 flow [2024-11-09 10:38:15,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:15,727 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:15,727 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:15,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:15,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:15,928 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:15,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:15,928 INFO L85 PathProgramCache]: Analyzing trace with hash 761685876, now seen corresponding path program 1 times [2024-11-09 10:38:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:15,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328624720] [2024-11-09 10:38:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:15,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:15,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:15,930 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:15,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-09 10:38:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:16,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:38:16,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:16,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:16,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:16,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:38:16,185 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:16,187 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:38:16,188 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-09 10:38:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:16,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:16,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328624720] [2024-11-09 10:38:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328624720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:38:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900594240] [2024-11-09 10:38:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:38:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:16,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:38:16,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:38:16,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-09 10:38:16,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:16,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:16,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-09 10:38:16,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:16,667 INFO L124 PetriNetUnfolderBase]: 477/901 cut-off events. [2024-11-09 10:38:16,668 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2024-11-09 10:38:16,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2534 conditions, 901 events. 477/901 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3543 event pairs, 395 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2523. Up to 800 conditions per place. [2024-11-09 10:38:16,671 INFO L140 encePairwiseOnDemand]: 118/124 looper letters, 68 selfloop transitions, 7 changer transitions 0/94 dead transitions. [2024-11-09 10:38:16,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 94 transitions, 477 flow [2024-11-09 10:38:16,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:38:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:38:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2024-11-09 10:38:16,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48655913978494625 [2024-11-09 10:38:16,672 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 266 flow. Second operand 3 states and 181 transitions. [2024-11-09 10:38:16,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 94 transitions, 477 flow [2024-11-09 10:38:16,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 94 transitions, 453 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:16,674 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 314 flow [2024-11-09 10:38:16,674 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-11-09 10:38:16,675 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -26 predicate places. [2024-11-09 10:38:16,675 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 314 flow [2024-11-09 10:38:16,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:16,675 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:16,675 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:16,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:16,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:16,876 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:16,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1611433875, now seen corresponding path program 1 times [2024-11-09 10:38:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039022778] [2024-11-09 10:38:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:38:16,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:16,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:16,879 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:16,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-09 10:38:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:38:17,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:38:17,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:17,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:38:17,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:17,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:17,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:17,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039022778] [2024-11-09 10:38:17,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039022778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:38:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027464843] [2024-11-09 10:38:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:38:17,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:38:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:38:17,251 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:38:17,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 314 flow. Second operand has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:17,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:17,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:38:17,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:17,911 INFO L124 PetriNetUnfolderBase]: 541/1023 cut-off events. [2024-11-09 10:38:17,912 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2024-11-09 10:38:17,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2946 conditions, 1023 events. 541/1023 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4512 event pairs, 48 based on Foata normal form. 16/1027 useless extension candidates. Maximal degree in co-relation 2934. Up to 562 conditions per place. [2024-11-09 10:38:17,915 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 105 selfloop transitions, 22 changer transitions 0/149 dead transitions. [2024-11-09 10:38:17,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 149 transitions, 811 flow [2024-11-09 10:38:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:38:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:38:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 541 transitions. [2024-11-09 10:38:17,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43629032258064515 [2024-11-09 10:38:17,917 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 314 flow. Second operand 10 states and 541 transitions. [2024-11-09 10:38:17,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 149 transitions, 811 flow [2024-11-09 10:38:17,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 149 transitions, 795 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 10:38:17,920 INFO L231 Difference]: Finished difference. Result has 105 places, 102 transitions, 462 flow [2024-11-09 10:38:17,920 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=462, PETRI_PLACES=105, PETRI_TRANSITIONS=102} [2024-11-09 10:38:17,921 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -13 predicate places. [2024-11-09 10:38:17,921 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 102 transitions, 462 flow [2024-11-09 10:38:17,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:17,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:17,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:17,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:18,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:18,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash -660361977, now seen corresponding path program 2 times [2024-11-09 10:38:18,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:18,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340657813] [2024-11-09 10:38:18,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:38:18,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:18,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:18,124 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:18,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-09 10:38:18,345 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 10:38:18,345 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:38:18,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:38:18,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:38:18,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-09 10:38:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:38:18,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:38:18,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:38:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340657813] [2024-11-09 10:38:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340657813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:38:18,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:38:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:38:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841468325] [2024-11-09 10:38:18,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:38:18,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:38:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:38:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:38:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:38:18,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 124 [2024-11-09 10:38:18,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 102 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:18,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:38:18,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 124 [2024-11-09 10:38:18,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:38:19,217 INFO L124 PetriNetUnfolderBase]: 644/1233 cut-off events. [2024-11-09 10:38:19,217 INFO L125 PetriNetUnfolderBase]: For 1886/1886 co-relation queries the response was YES. [2024-11-09 10:38:19,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4111 conditions, 1233 events. 644/1233 cut-off events. For 1886/1886 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5922 event pairs, 35 based on Foata normal form. 16/1215 useless extension candidates. Maximal degree in co-relation 4093. Up to 421 conditions per place. [2024-11-09 10:38:19,222 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 140 selfloop transitions, 34 changer transitions 0/196 dead transitions. [2024-11-09 10:38:19,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 196 transitions, 1261 flow [2024-11-09 10:38:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:38:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-09 10:38:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 651 transitions. [2024-11-09 10:38:19,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4375 [2024-11-09 10:38:19,224 INFO L175 Difference]: Start difference. First operand has 105 places, 102 transitions, 462 flow. Second operand 12 states and 651 transitions. [2024-11-09 10:38:19,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 196 transitions, 1261 flow [2024-11-09 10:38:19,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 196 transitions, 1230 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-11-09 10:38:19,230 INFO L231 Difference]: Finished difference. Result has 117 places, 117 transitions, 644 flow [2024-11-09 10:38:19,230 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=644, PETRI_PLACES=117, PETRI_TRANSITIONS=117} [2024-11-09 10:38:19,230 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2024-11-09 10:38:19,231 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 117 transitions, 644 flow [2024-11-09 10:38:19,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 46.125) internal successors, (369), 8 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:38:19,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:38:19,231 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:19,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-09 10:38:19,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:19,432 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-09 10:38:19,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:38:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash 910036231, now seen corresponding path program 3 times [2024-11-09 10:38:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:38:19,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266667756] [2024-11-09 10:38:19,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:38:19,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-09 10:38:19,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:38:19,435 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:38:19,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 (24)] Waiting until timeout for monitored process [2024-11-09 10:38:19,735 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 10:38:19,736 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 10:38:19,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:38:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:38:19,970 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 10:38:19,971 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:38:19,973 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-09 10:38:19,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-09 10:38:19,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-09 10:38:19,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-11-09 10:38:19,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-09 10:38:19,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-09 10:38:19,975 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-09 10:38:19,976 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-09 10:38:19,977 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (32 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-09 10:38:19,978 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-09 10:38:19,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-09 10:38:19,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-11-09 10:38:20,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:38:20,184 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:38:20,239 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:38:20,239 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:38:20,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:38:20 BasicIcfg [2024-11-09 10:38:20,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:38:20,244 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:38:20,244 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:38:20,244 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:38:20,245 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:37:45" (3/4) ... [2024-11-09 10:38:20,246 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:38:20,247 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:38:20,248 INFO L158 Benchmark]: Toolchain (without parser) took 36193.04ms. Allocated memory was 83.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 42.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 484.0MB. Max. memory is 16.1GB. [2024-11-09 10:38:20,248 INFO L158 Benchmark]: CDTParser took 1.61ms. Allocated memory is still 50.3MB. Free memory is still 23.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:38:20,248 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.62ms. Allocated memory was 83.9MB in the beginning and 136.3MB in the end (delta: 52.4MB). Free memory was 42.0MB in the beginning and 97.1MB in the end (delta: -55.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2024-11-09 10:38:20,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.07ms. Allocated memory is still 136.3MB. Free memory was 97.1MB in the beginning and 94.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:38:20,249 INFO L158 Benchmark]: Boogie Preprocessor took 69.10ms. Allocated memory is still 136.3MB. Free memory was 94.4MB in the beginning and 89.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:38:20,249 INFO L158 Benchmark]: RCFGBuilder took 982.64ms. Allocated memory is still 136.3MB. Free memory was 89.3MB in the beginning and 52.0MB in the end (delta: 37.3MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. [2024-11-09 10:38:20,250 INFO L158 Benchmark]: TraceAbstraction took 34371.89ms. Allocated memory was 136.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 440.9MB. Max. memory is 16.1GB. [2024-11-09 10:38:20,250 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 1.6GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:38:20,251 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.61ms. Allocated memory is still 50.3MB. Free memory is still 23.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.62ms. Allocated memory was 83.9MB in the beginning and 136.3MB in the end (delta: 52.4MB). Free memory was 42.0MB in the beginning and 97.1MB in the end (delta: -55.1MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.07ms. Allocated memory is still 136.3MB. Free memory was 97.1MB in the beginning and 94.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.10ms. Allocated memory is still 136.3MB. Free memory was 94.4MB in the beginning and 89.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 982.64ms. Allocated memory is still 136.3MB. Free memory was 89.3MB in the beginning and 52.0MB in the end (delta: 37.3MB). Peak memory consumption was 38.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34371.89ms. Allocated memory was 136.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 52.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 440.9MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 1.6GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, d={3:24}, data={3:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3907] 1 data->shared.a = 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, t1=0, t2=1] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\old(arg)={3:24}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result=0, \result={0:0}, arg={3:24}, d={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, res=0, t1=0, t2=1] [L3902] 2 struct device *dev = (struct device*)arg; [L3903] 2 struct my_data *data; [L3904] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3938] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\old(arg)={3:24}, \old(data)={3:0}, \result={0:0}, arg={3:24}, data={3:0}, data={3:0}, dev={3:24}, lb=0, status={7:0}, t1=0, t2=1] [L3941] 0 data->shared.a = 3 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3907] 2 data->shared.a = 1 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3944] 0 data->shared.b = 3 VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] [L3947] EXPR 0 data->shared.a [L3947] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_5-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_5-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={3:24}, \result={0:0}, arg={3:24}, data={3:0}, dev={3:24}, lb=0, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 131 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2914 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2431 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 152 IncrementalHoareTripleChecker+Unchecked, 48 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6172 IncrementalHoareTripleChecker+Invalid, 6427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 106 mSDtfsCounter, 6172 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 361 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1083occurred in iteration=13, InterpolantAutomatonStates: 120, 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.9s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 325 ConstructedInterpolants, 5 QuantifiedInterpolants, 2185 SizeOfPredicates, 137 NumberOfNonLiveVariables, 3189 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-09 10:38:20,283 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