./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:23:30,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:23:30,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 03:23:30,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:23:30,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:23:30,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:23:30,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:23:30,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:23:30,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:23:30,429 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:23:30,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:23:30,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:23:30,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:23:30,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:23:30,432 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:23:30,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:23:30,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:23:30,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:23:30,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:23:30,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:23:30,433 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:23:30,433 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:23:30,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:23:30,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:23:30,434 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:23:30,434 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:23:30,434 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:23:30,434 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:23:30,435 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:23:30,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:23:30,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:23:30,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:23:30,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:23:30,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:23:30,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:23:30,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:23:30,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 03:23:30,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 03:23:30,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:23:30,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:23:30,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:23:30,439 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:23:30,439 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-11-17 03:23:30,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:23:30,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:23:30,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:23:30,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:23:30,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:23:30,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-17 03:23:31,901 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:23:32,138 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:23:32,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-17 03:23:32,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba37272c4/65d4985752f047a2844fc523af74c0c5/FLAG67982fcf0 [2024-11-17 03:23:32,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba37272c4/65d4985752f047a2844fc523af74c0c5 [2024-11-17 03:23:32,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:23:32,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:23:32,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:23:32,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:23:32,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:23:32,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:23:32" (1/1) ... [2024-11-17 03:23:32,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60bf2cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:32, skipping insertion in model container [2024-11-17 03:23:32,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:23:32" (1/1) ... [2024-11-17 03:23:32,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:23:32,843 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:32,853 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:32,860 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:32,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:23:32,890 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-17 03:23:32,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ba1074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:32, skipping insertion in model container [2024-11-17 03:23:32,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:23:32,891 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 03:23:32,893 INFO L158 Benchmark]: Toolchain (without parser) took 436.17ms. Allocated memory is still 176.2MB. Free memory was 117.7MB in the beginning and 94.0MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 03:23:32,894 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:23:32,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.74ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 94.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-17 03:23:32,895 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.74ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 94.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3904]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 03:23:34,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 03:23:34,595 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 03:23:34,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 03:23:34,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 03:23:34,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 03:23:34,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 03:23:34,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 03:23:34,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 03:23:34,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 03:23:34,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 03:23:34,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 03:23:34,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 03:23:34,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 03:23:34,631 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 03:23:34,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 03:23:34,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 03:23:34,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 03:23:34,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 03:23:34,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 03:23:34,632 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 03:23:34,635 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 03:23:34,636 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 03:23:34,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 03:23:34,636 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 03:23:34,636 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 03:23:34,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 03:23:34,637 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 03:23:34,637 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 03:23:34,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 03:23:34,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 03:23:34,637 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 03:23:34,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 03:23:34,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 03:23:34,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 03:23:34,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:23:34,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 03:23:34,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 03:23:34,638 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 03:23:34,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 03:23:34,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 03:23:34,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 03:23:34,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 03:23:34,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 03:23:34,640 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 [2024-11-17 03:23:34,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 03:23:34,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 03:23:34,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 03:23:34,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 03:23:34,915 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 03:23:34,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-17 03:23:36,204 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 03:23:36,456 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 03:23:36,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-2_4-container_of.i [2024-11-17 03:23:36,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f00e557/ede5fcfaf4f8418d8d23895284024a98/FLAGd0f66bd7c [2024-11-17 03:23:36,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65f00e557/ede5fcfaf4f8418d8d23895284024a98 [2024-11-17 03:23:36,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 03:23:36,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 03:23:36,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 03:23:36,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 03:23:36,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 03:23:36,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:23:36" (1/1) ... [2024-11-17 03:23:36,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61c34764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:36, skipping insertion in model container [2024-11-17 03:23:36,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:23:36" (1/1) ... [2024-11-17 03:23:36,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:23:36,922 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:36,931 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:36,937 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:36,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:23:36,962 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 03:23:36,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 03:23:37,006 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:37,010 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:37,012 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 03:23:37,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:23:37,018 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 03:23:37,080 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 03:23:37,129 INFO L204 MainTranslator]: Completed translation [2024-11-17 03:23:37,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37 WrapperNode [2024-11-17 03:23:37,129 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 03:23:37,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 03:23:37,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 03:23:37,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 03:23:37,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,186 INFO L138 Inliner]: procedures = 251, calls = 56, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 152 [2024-11-17 03:23:37,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 03:23:37,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 03:23:37,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 03:23:37,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 03:23:37,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,215 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-17 03:23:37,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,229 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 03:23:37,243 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 03:23:37,244 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 03:23:37,244 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 03:23:37,244 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (1/1) ... [2024-11-17 03:23:37,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 03:23:37,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 03:23:37,282 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-17 03:23:37,288 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-17 03:23:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 03:23:37,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 03:23:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 03:23:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-11-17 03:23:37,324 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-11-17 03:23:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-17 03:23:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 03:23:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 03:23:37,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 03:23:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 03:23:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 03:23:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 03:23:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 03:23:37,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 03:23:37,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 03:23:37,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 03:23:37,327 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-17 03:23:37,611 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 03:23:37,613 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 03:23:38,107 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-17 03:23:38,107 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 03:23:38,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 03:23:38,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 03:23:38,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:23:38 BoogieIcfgContainer [2024-11-17 03:23:38,305 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 03:23:38,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 03:23:38,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 03:23:38,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 03:23:38,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:23:36" (1/3) ... [2024-11-17 03:23:38,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d5f961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:23:38, skipping insertion in model container [2024-11-17 03:23:38,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:23:37" (2/3) ... [2024-11-17 03:23:38,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68d5f961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:23:38, skipping insertion in model container [2024-11-17 03:23:38,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:23:38" (3/3) ... [2024-11-17 03:23:38,315 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2024-11-17 03:23:38,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 03:23:38,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-17 03:23:38,334 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-17 03:23:38,400 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-17 03:23:38,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 124 transitions, 262 flow [2024-11-17 03:23:38,494 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2024-11-17 03:23:38,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-17 03:23:38,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 14/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 695 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 83. Up to 4 conditions per place. [2024-11-17 03:23:38,498 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 124 transitions, 262 flow [2024-11-17 03:23:38,503 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 122 transitions, 256 flow [2024-11-17 03:23:38,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 03:23:38,515 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;@2c28b2c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 03:23:38,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-17 03:23:38,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-17 03:23:38,517 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-17 03:23:38,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-17 03:23:38,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:38,518 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-17 03:23:38,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:38,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash 557859, now seen corresponding path program 1 times [2024-11-17 03:23:38,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:38,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595654342] [2024-11-17 03:23:38,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:38,533 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-17 03:23:38,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:38,535 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-17 03:23:38,555 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-17 03:23:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:38,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:23:38,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:38,727 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-17 03:23:38,739 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-17 03:23:38,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:38,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:38,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595654342] [2024-11-17 03:23:38,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595654342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:38,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:38,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:23:38,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943666306] [2024-11-17 03:23:38,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:38,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:38,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:38,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:38,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-17 03:23:38,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 122 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-17 03:23:38,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:40,663 INFO L124 PetriNetUnfolderBase]: 9687/18675 cut-off events. [2024-11-17 03:23:40,664 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-17 03:23:40,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33796 conditions, 18675 events. 9687/18675 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 178776 event pairs, 559 based on Foata normal form. 792/11730 useless extension candidates. Maximal degree in co-relation 33526. Up to 14089 conditions per place. [2024-11-17 03:23:40,776 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 95 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2024-11-17 03:23:40,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 134 transitions, 474 flow [2024-11-17 03:23:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:40,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2024-11-17 03:23:40,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6021505376344086 [2024-11-17 03:23:40,788 INFO L175 Difference]: Start difference. First operand has 118 places, 122 transitions, 256 flow. Second operand 3 states and 224 transitions. [2024-11-17 03:23:40,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 134 transitions, 474 flow [2024-11-17 03:23:40,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 134 transitions, 466 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:23:40,795 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 224 flow [2024-11-17 03:23:40,797 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-17 03:23:40,800 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -8 predicate places. [2024-11-17 03:23:40,800 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 224 flow [2024-11-17 03:23:40,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:40,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:40,801 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-17 03:23:40,807 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-17 03:23:41,005 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-17 03:23:41,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:41,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash 557860, now seen corresponding path program 1 times [2024-11-17 03:23:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:41,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260544809] [2024-11-17 03:23:41,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:41,007 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-17 03:23:41,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:41,010 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-17 03:23:41,011 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-17 03:23:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:41,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:23:41,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:41,114 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-17 03:23:41,124 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-17 03:23:41,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:41,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:41,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260544809] [2024-11-17 03:23:41,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260544809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:41,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:41,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:23:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901301036] [2024-11-17 03:23:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:41,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:41,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:41,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:41,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-17 03:23:41,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:41,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:41,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-17 03:23:41,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:42,653 INFO L124 PetriNetUnfolderBase]: 9687/18673 cut-off events. [2024-11-17 03:23:42,653 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2024-11-17 03:23:42,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33960 conditions, 18673 events. 9687/18673 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 178988 event pairs, 559 based on Foata normal form. 1/10937 useless extension candidates. Maximal degree in co-relation 1994. Up to 14089 conditions per place. [2024-11-17 03:23:42,717 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-11-17 03:23:42,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 132 transitions, 464 flow [2024-11-17 03:23:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-11-17 03:23:42,720 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5860215053763441 [2024-11-17 03:23:42,720 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 224 flow. Second operand 3 states and 218 transitions. [2024-11-17 03:23:42,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 132 transitions, 464 flow [2024-11-17 03:23:42,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 132 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:42,723 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 220 flow [2024-11-17 03:23:42,723 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-17 03:23:42,724 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-17 03:23:42,724 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 220 flow [2024-11-17 03:23:42,724 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-17 03:23:42,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:42,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-17 03:23:42,730 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-17 03:23:42,925 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-17 03:23:42,925 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:42,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash 17292180, now seen corresponding path program 1 times [2024-11-17 03:23:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:42,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217556146] [2024-11-17 03:23:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:42,928 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-17 03:23:42,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:42,929 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-17 03:23:42,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 03:23:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:42,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:23:42,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:43,003 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-17 03:23:43,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:43,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:43,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217556146] [2024-11-17 03:23:43,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217556146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:43,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:43,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:23:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228553084] [2024-11-17 03:23:43,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:43,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:43,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:43,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:43,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 124 [2024-11-17 03:23:43,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:43,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:43,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 124 [2024-11-17 03:23:43,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:44,235 INFO L124 PetriNetUnfolderBase]: 9686/16135 cut-off events. [2024-11-17 03:23:44,236 INFO L125 PetriNetUnfolderBase]: For 189/189 co-relation queries the response was YES. [2024-11-17 03:23:44,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31422 conditions, 16135 events. 9686/16135 cut-off events. For 189/189 co-relation queries the response was YES. Maximal size of possible extension queue 830. Compared 122242 event pairs, 9321 based on Foata normal form. 1/9362 useless extension candidates. Maximal degree in co-relation 16816. Up to 14510 conditions per place. [2024-11-17 03:23:44,321 INFO L140 encePairwiseOnDemand]: 121/124 looper letters, 94 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-17 03:23:44,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 462 flow [2024-11-17 03:23:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:44,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-11-17 03:23:44,328 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5913978494623656 [2024-11-17 03:23:44,328 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 220 flow. Second operand 3 states and 220 transitions. [2024-11-17 03:23:44,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 462 flow [2024-11-17 03:23:44,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 458 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:44,332 INFO L231 Difference]: Finished difference. Result has 108 places, 105 transitions, 218 flow [2024-11-17 03:23:44,332 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-17 03:23:44,332 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-17 03:23:44,333 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 105 transitions, 218 flow [2024-11-17 03:23:44,333 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-17 03:23:44,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:44,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:44,339 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-17 03:23:44,537 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-17 03:23:44,537 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:44,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:44,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1496791701, now seen corresponding path program 1 times [2024-11-17 03:23:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:44,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752626896] [2024-11-17 03:23:44,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:44,539 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-17 03:23:44,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:44,540 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-17 03:23:44,541 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-17 03:23:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:44,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 03:23:44,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:44,644 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-17 03:23:44,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:44,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752626896] [2024-11-17 03:23:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752626896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40713467] [2024-11-17 03:23:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:44,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:23:44,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:23:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:23:44,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:23:44,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 105 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:44,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:44,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:23:44,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:45,782 INFO L124 PetriNetUnfolderBase]: 9685/16735 cut-off events. [2024-11-17 03:23:45,782 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-17 03:23:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32017 conditions, 16735 events. 9685/16735 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 132733 event pairs, 9685 based on Foata normal form. 1/9903 useless extension candidates. Maximal degree in co-relation 30689. Up to 15055 conditions per place. [2024-11-17 03:23:45,872 INFO L140 encePairwiseOnDemand]: 120/124 looper letters, 76 selfloop transitions, 3 changer transitions 1/115 dead transitions. [2024-11-17 03:23:45,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 115 transitions, 400 flow [2024-11-17 03:23:45,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:23:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:23:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2024-11-17 03:23:45,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5020161290322581 [2024-11-17 03:23:45,876 INFO L175 Difference]: Start difference. First operand has 108 places, 105 transitions, 218 flow. Second operand 4 states and 249 transitions. [2024-11-17 03:23:45,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 115 transitions, 400 flow [2024-11-17 03:23:45,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 115 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:45,891 INFO L231 Difference]: Finished difference. Result has 111 places, 107 transitions, 235 flow [2024-11-17 03:23:45,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=111, PETRI_TRANSITIONS=107} [2024-11-17 03:23:45,894 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -7 predicate places. [2024-11-17 03:23:45,894 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 107 transitions, 235 flow [2024-11-17 03:23:45,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:45,895 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:45,895 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:45,901 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-17 03:23:46,095 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-17 03:23:46,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:46,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:46,096 INFO L85 PathProgramCache]: Analyzing trace with hash 844097183, now seen corresponding path program 1 times [2024-11-17 03:23:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:46,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222422672] [2024-11-17 03:23:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:46,097 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-17 03:23:46,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:46,100 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-17 03:23:46,101 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-17 03:23:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:46,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 03:23:46,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:46,197 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-17 03:23:46,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-17 03:23:46,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:46,211 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:46,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222422672] [2024-11-17 03:23:46,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222422672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:46,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:46,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:23:46,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894609708] [2024-11-17 03:23:46,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:46,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:46,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:46,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:46,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 124 [2024-11-17 03:23:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 107 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:46,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:46,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 124 [2024-11-17 03:23:46,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:47,419 INFO L124 PetriNetUnfolderBase]: 10413/17239 cut-off events. [2024-11-17 03:23:47,419 INFO L125 PetriNetUnfolderBase]: For 546/546 co-relation queries the response was YES. [2024-11-17 03:23:47,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34043 conditions, 17239 events. 10413/17239 cut-off events. For 546/546 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 130125 event pairs, 9321 based on Foata normal form. 0/10288 useless extension candidates. Maximal degree in co-relation 33995. Up to 14501 conditions per place. [2024-11-17 03:23:47,490 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 96 selfloop transitions, 5 changer transitions 0/128 dead transitions. [2024-11-17 03:23:47,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 128 transitions, 479 flow [2024-11-17 03:23:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2024-11-17 03:23:47,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.553763440860215 [2024-11-17 03:23:47,495 INFO L175 Difference]: Start difference. First operand has 111 places, 107 transitions, 235 flow. Second operand 3 states and 206 transitions. [2024-11-17 03:23:47,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 128 transitions, 479 flow [2024-11-17 03:23:47,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 128 transitions, 478 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:23:47,505 INFO L231 Difference]: Finished difference. Result has 107 places, 102 transitions, 234 flow [2024-11-17 03:23:47,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=107, PETRI_TRANSITIONS=102} [2024-11-17 03:23:47,506 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -11 predicate places. [2024-11-17 03:23:47,506 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 102 transitions, 234 flow [2024-11-17 03:23:47,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:47,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:47,506 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:47,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 03:23:47,707 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-17 03:23:47,707 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:47,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:47,708 INFO L85 PathProgramCache]: Analyzing trace with hash 844097184, now seen corresponding path program 1 times [2024-11-17 03:23:47,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:47,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904339226] [2024-11-17 03:23:47,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:47,709 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-17 03:23:47,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:47,715 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-17 03:23:47,716 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-17 03:23:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:47,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 03:23:47,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:47,806 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-17 03:23:47,846 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-17 03:23:47,846 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:47,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:47,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904339226] [2024-11-17 03:23:47,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904339226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:47,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:47,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:23:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415391069] [2024-11-17 03:23:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:47,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:23:47,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:47,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:23:47,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:23:47,909 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 124 [2024-11-17 03:23:47,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 102 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:47,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:47,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 124 [2024-11-17 03:23:47,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:48,786 INFO L124 PetriNetUnfolderBase]: 9685/16158 cut-off events. [2024-11-17 03:23:48,786 INFO L125 PetriNetUnfolderBase]: For 941/941 co-relation queries the response was YES. [2024-11-17 03:23:48,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32044 conditions, 16158 events. 9685/16158 cut-off events. For 941/941 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 124533 event pairs, 3107 based on Foata normal form. 394/9933 useless extension candidates. Maximal degree in co-relation 28012. Up to 10162 conditions per place. [2024-11-17 03:23:48,841 INFO L140 encePairwiseOnDemand]: 117/124 looper letters, 107 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2024-11-17 03:23:48,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 135 transitions, 526 flow [2024-11-17 03:23:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:23:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:23:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2024-11-17 03:23:48,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5940860215053764 [2024-11-17 03:23:48,843 INFO L175 Difference]: Start difference. First operand has 107 places, 102 transitions, 234 flow. Second operand 3 states and 221 transitions. [2024-11-17 03:23:48,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 135 transitions, 526 flow [2024-11-17 03:23:48,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 135 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-17 03:23:48,858 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 250 flow [2024-11-17 03:23:48,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2024-11-17 03:23:48,858 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -10 predicate places. [2024-11-17 03:23:48,859 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 250 flow [2024-11-17 03:23:48,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:48,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:48,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:48,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-17 03:23:49,062 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-17 03:23:49,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:49,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:49,063 INFO L85 PathProgramCache]: Analyzing trace with hash 509166757, now seen corresponding path program 1 times [2024-11-17 03:23:49,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:49,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481994287] [2024-11-17 03:23:49,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:49,064 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-17 03:23:49,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:49,067 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-17 03:23:49,068 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-17 03:23:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:49,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 03:23:49,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:49,170 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-17 03:23:49,226 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-17 03:23:49,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:49,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:49,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481994287] [2024-11-17 03:23:49,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481994287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:49,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:49,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638235692] [2024-11-17 03:23:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:49,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:49,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:49,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:49,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:49,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:23:49,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:49,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:49,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:23:49,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:50,617 INFO L124 PetriNetUnfolderBase]: 8707/15190 cut-off events. [2024-11-17 03:23:50,617 INFO L125 PetriNetUnfolderBase]: For 778/778 co-relation queries the response was YES. [2024-11-17 03:23:50,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29877 conditions, 15190 events. 8707/15190 cut-off events. For 778/778 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 121805 event pairs, 799 based on Foata normal form. 0/9380 useless extension candidates. Maximal degree in co-relation 9239. Up to 8441 conditions per place. [2024-11-17 03:23:50,672 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 157 selfloop transitions, 9 changer transitions 1/197 dead transitions. [2024-11-17 03:23:50,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 197 transitions, 785 flow [2024-11-17 03:23:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:23:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:23:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 466 transitions. [2024-11-17 03:23:50,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5368663594470046 [2024-11-17 03:23:50,675 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 250 flow. Second operand 7 states and 466 transitions. [2024-11-17 03:23:50,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 197 transitions, 785 flow [2024-11-17 03:23:50,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 197 transitions, 777 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-17 03:23:50,699 INFO L231 Difference]: Finished difference. Result has 115 places, 107 transitions, 295 flow [2024-11-17 03:23:50,699 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=295, PETRI_PLACES=115, PETRI_TRANSITIONS=107} [2024-11-17 03:23:50,700 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, -3 predicate places. [2024-11-17 03:23:50,700 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 107 transitions, 295 flow [2024-11-17 03:23:50,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:50,700 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:50,700 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:50,709 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-17 03:23:50,901 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-17 03:23:50,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:50,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash 509166756, now seen corresponding path program 1 times [2024-11-17 03:23:50,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:50,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184025935] [2024-11-17 03:23:50,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:50,902 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-17 03:23:50,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:50,904 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-17 03:23:50,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 03:23:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:50,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:23:50,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:51,001 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-17 03:23:51,040 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-17 03:23:51,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:51,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184025935] [2024-11-17 03:23:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184025935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:51,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12938937] [2024-11-17 03:23:51,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:51,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:51,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:23:51,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 107 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:51,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:51,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:23:51,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:52,828 INFO L124 PetriNetUnfolderBase]: 7050/12331 cut-off events. [2024-11-17 03:23:52,828 INFO L125 PetriNetUnfolderBase]: For 3522/3522 co-relation queries the response was YES. [2024-11-17 03:23:52,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26099 conditions, 12331 events. 7050/12331 cut-off events. For 3522/3522 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 93960 event pairs, 685 based on Foata normal form. 0/8927 useless extension candidates. Maximal degree in co-relation 7024. Up to 8172 conditions per place. [2024-11-17 03:23:52,894 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 177 selfloop transitions, 14 changer transitions 0/221 dead transitions. [2024-11-17 03:23:52,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 221 transitions, 913 flow [2024-11-17 03:23:52,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 533 transitions. [2024-11-17 03:23:52,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5372983870967742 [2024-11-17 03:23:52,896 INFO L175 Difference]: Start difference. First operand has 115 places, 107 transitions, 295 flow. Second operand 8 states and 533 transitions. [2024-11-17 03:23:52,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 221 transitions, 913 flow [2024-11-17 03:23:52,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 221 transitions, 906 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-17 03:23:52,915 INFO L231 Difference]: Finished difference. Result has 126 places, 112 transitions, 379 flow [2024-11-17 03:23:52,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=126, PETRI_TRANSITIONS=112} [2024-11-17 03:23:52,915 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2024-11-17 03:23:52,915 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 112 transitions, 379 flow [2024-11-17 03:23:52,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.6) internal successors, (218), 5 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:52,916 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:52,916 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:52,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 03:23:53,116 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-17 03:23:53,117 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:53,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:53,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1319575897, now seen corresponding path program 1 times [2024-11-17 03:23:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:53,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549122202] [2024-11-17 03:23:53,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:53,119 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-17 03:23:53,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:53,120 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-17 03:23:53,121 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-17 03:23:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:53,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:23:53,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:53,221 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-17 03:23:53,257 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-17 03:23:53,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:53,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549122202] [2024-11-17 03:23:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549122202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:53,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:53,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877752429] [2024-11-17 03:23:53,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:53,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:53,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:23:53,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 112 transitions, 379 flow. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:53,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:53,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:23:53,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:54,901 INFO L124 PetriNetUnfolderBase]: 6173/10813 cut-off events. [2024-11-17 03:23:54,901 INFO L125 PetriNetUnfolderBase]: For 7642/7642 co-relation queries the response was YES. [2024-11-17 03:23:54,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25431 conditions, 10813 events. 6173/10813 cut-off events. For 7642/7642 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 78933 event pairs, 813 based on Foata normal form. 0/8488 useless extension candidates. Maximal degree in co-relation 22604. Up to 6421 conditions per place. [2024-11-17 03:23:54,954 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 176 selfloop transitions, 17 changer transitions 0/223 dead transitions. [2024-11-17 03:23:54,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 223 transitions, 1132 flow [2024-11-17 03:23:54,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 03:23:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-17 03:23:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 524 transitions. [2024-11-17 03:23:54,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5282258064516129 [2024-11-17 03:23:54,957 INFO L175 Difference]: Start difference. First operand has 126 places, 112 transitions, 379 flow. Second operand 8 states and 524 transitions. [2024-11-17 03:23:54,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 223 transitions, 1132 flow [2024-11-17 03:23:54,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 223 transitions, 1108 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-17 03:23:54,975 INFO L231 Difference]: Finished difference. Result has 133 places, 121 transitions, 491 flow [2024-11-17 03:23:54,975 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=133, PETRI_TRANSITIONS=121} [2024-11-17 03:23:54,976 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 15 predicate places. [2024-11-17 03:23:54,976 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 121 transitions, 491 flow [2024-11-17 03:23:54,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:54,977 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:54,977 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:54,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 03:23:55,177 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-17 03:23:55,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:55,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:55,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1319575896, now seen corresponding path program 1 times [2024-11-17 03:23:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312404077] [2024-11-17 03:23:55,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:55,179 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-17 03:23:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:55,181 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-17 03:23:55,182 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-17 03:23:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:55,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 03:23:55,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:55,303 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-17 03:23:55,385 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-17 03:23:55,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:55,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312404077] [2024-11-17 03:23:55,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312404077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:55,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:55,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:23:55,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364342030] [2024-11-17 03:23:55,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:55,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 03:23:55,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:55,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 03:23:55,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 03:23:55,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:23:55,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 121 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:55,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:55,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:23:55,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:56,696 INFO L124 PetriNetUnfolderBase]: 5374/9318 cut-off events. [2024-11-17 03:23:56,696 INFO L125 PetriNetUnfolderBase]: For 8921/8923 co-relation queries the response was YES. [2024-11-17 03:23:56,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23984 conditions, 9318 events. 5374/9318 cut-off events. For 8921/8923 co-relation queries the response was YES. Maximal size of possible extension queue 403. Compared 65560 event pairs, 1522 based on Foata normal form. 458/8552 useless extension candidates. Maximal degree in co-relation 21352. Up to 5129 conditions per place. [2024-11-17 03:23:56,724 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 148 selfloop transitions, 14 changer transitions 1/193 dead transitions. [2024-11-17 03:23:56,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 193 transitions, 1063 flow [2024-11-17 03:23:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 03:23:56,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-17 03:23:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2024-11-17 03:23:56,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.511520737327189 [2024-11-17 03:23:56,725 INFO L175 Difference]: Start difference. First operand has 133 places, 121 transitions, 491 flow. Second operand 7 states and 444 transitions. [2024-11-17 03:23:56,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 193 transitions, 1063 flow [2024-11-17 03:23:56,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 193 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-17 03:23:56,739 INFO L231 Difference]: Finished difference. Result has 141 places, 124 transitions, 567 flow [2024-11-17 03:23:56,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=141, PETRI_TRANSITIONS=124} [2024-11-17 03:23:56,739 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-11-17 03:23:56,740 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 124 transitions, 567 flow [2024-11-17 03:23:56,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 5 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:56,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:56,740 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:56,746 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-17 03:23:56,940 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-17 03:23:56,940 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:56,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:56,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1321466887, now seen corresponding path program 1 times [2024-11-17 03:23:56,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:56,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350631605] [2024-11-17 03:23:56,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:56,941 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-17 03:23:56,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:56,943 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-17 03:23:56,943 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-17 03:23:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:57,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 03:23:57,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:57,070 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-17 03:23:57,111 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 03:23:57,111 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-17 03:23:57,144 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-17 03:23:57,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:57,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350631605] [2024-11-17 03:23:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350631605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:23:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743362823] [2024-11-17 03:23:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:57,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:23:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:23:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:23:57,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 124 [2024-11-17 03:23:57,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 124 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:57,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:57,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 124 [2024-11-17 03:23:57,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:58,420 INFO L124 PetriNetUnfolderBase]: 4718/7969 cut-off events. [2024-11-17 03:23:58,420 INFO L125 PetriNetUnfolderBase]: For 11625/11629 co-relation queries the response was YES. [2024-11-17 03:23:58,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22462 conditions, 7969 events. 4718/7969 cut-off events. For 11625/11629 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 52199 event pairs, 2290 based on Foata normal form. 2/7215 useless extension candidates. Maximal degree in co-relation 20028. Up to 3737 conditions per place. [2024-11-17 03:23:58,462 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 102 selfloop transitions, 13 changer transitions 0/142 dead transitions. [2024-11-17 03:23:58,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 853 flow [2024-11-17 03:23:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:23:58,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:23:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2024-11-17 03:23:58,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4778225806451613 [2024-11-17 03:23:58,463 INFO L175 Difference]: Start difference. First operand has 141 places, 124 transitions, 567 flow. Second operand 4 states and 237 transitions. [2024-11-17 03:23:58,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 853 flow [2024-11-17 03:23:58,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 142 transitions, 832 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-17 03:23:58,475 INFO L231 Difference]: Finished difference. Result has 135 places, 120 transitions, 564 flow [2024-11-17 03:23:58,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=564, PETRI_PLACES=135, PETRI_TRANSITIONS=120} [2024-11-17 03:23:58,476 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 17 predicate places. [2024-11-17 03:23:58,476 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 120 transitions, 564 flow [2024-11-17 03:23:58,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:58,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:58,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:58,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 03:23:58,679 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-17 03:23:58,679 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:58,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1321466886, now seen corresponding path program 1 times [2024-11-17 03:23:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861202356] [2024-11-17 03:23:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:58,680 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-17 03:23:58,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:58,683 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-17 03:23:58,684 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-17 03:23:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:23:58,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 03:23:58,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:23:58,823 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-17 03:23:58,829 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-17 03:23:58,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:23:58,913 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-17 03:23:58,923 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 03:23:58,924 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-17 03:23:58,936 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-17 03:23:58,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:23:58,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:23:58,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861202356] [2024-11-17 03:23:58,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861202356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:23:58,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:23:58,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:23:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452444193] [2024-11-17 03:23:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:23:58,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:23:58,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:23:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:23:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:23:59,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 124 [2024-11-17 03:23:59,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 120 transitions, 564 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:59,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:23:59,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 124 [2024-11-17 03:23:59,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:23:59,752 INFO L124 PetriNetUnfolderBase]: 3614/6290 cut-off events. [2024-11-17 03:23:59,752 INFO L125 PetriNetUnfolderBase]: For 9481/9485 co-relation queries the response was YES. [2024-11-17 03:23:59,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17900 conditions, 6290 events. 3614/6290 cut-off events. For 9481/9485 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 40813 event pairs, 1834 based on Foata normal form. 2/6010 useless extension candidates. Maximal degree in co-relation 15995. Up to 2373 conditions per place. [2024-11-17 03:23:59,778 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 110 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2024-11-17 03:23:59,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 144 transitions, 874 flow [2024-11-17 03:23:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:23:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:23:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 228 transitions. [2024-11-17 03:23:59,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4596774193548387 [2024-11-17 03:23:59,780 INFO L175 Difference]: Start difference. First operand has 135 places, 120 transitions, 564 flow. Second operand 4 states and 228 transitions. [2024-11-17 03:23:59,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 144 transitions, 874 flow [2024-11-17 03:23:59,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 144 transitions, 848 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:23:59,792 INFO L231 Difference]: Finished difference. Result has 131 places, 116 transitions, 552 flow [2024-11-17 03:23:59,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=131, PETRI_TRANSITIONS=116} [2024-11-17 03:23:59,793 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 13 predicate places. [2024-11-17 03:23:59,793 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 116 transitions, 552 flow [2024-11-17 03:23:59,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:23:59,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:23:59,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:23:59,800 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-17 03:23:59,994 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-17 03:23:59,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:23:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:23:59,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1380658882, now seen corresponding path program 1 times [2024-11-17 03:23:59,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:23:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599765327] [2024-11-17 03:23:59,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:23:59,995 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-17 03:23:59,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:23:59,996 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-17 03:23:59,997 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-17 03:24:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:24:00,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 03:24:00,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:24:00,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:00,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:00,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:00,175 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:00,176 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:00,179 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-17 03:24:00,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:00,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 03:24:00,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 73 [2024-11-17 03:24:00,261 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-17 03:24:00,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:24:00,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:24:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599765327] [2024-11-17 03:24:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599765327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:24:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:24:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 03:24:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847960098] [2024-11-17 03:24:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:24:00,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:24:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:24:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:24:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:24:00,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-17 03:24:00,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 116 transitions, 552 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:00,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:24:00,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-17 03:24:00,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:24:01,957 INFO L124 PetriNetUnfolderBase]: 5038/8557 cut-off events. [2024-11-17 03:24:01,957 INFO L125 PetriNetUnfolderBase]: For 11432/11436 co-relation queries the response was YES. [2024-11-17 03:24:01,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24095 conditions, 8557 events. 5038/8557 cut-off events. For 11432/11436 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 57599 event pairs, 2585 based on Foata normal form. 2/8088 useless extension candidates. Maximal degree in co-relation 21663. Up to 6032 conditions per place. [2024-11-17 03:24:01,995 INFO L140 encePairwiseOnDemand]: 114/124 looper letters, 126 selfloop transitions, 13 changer transitions 0/166 dead transitions. [2024-11-17 03:24:01,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 166 transitions, 1032 flow [2024-11-17 03:24:01,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 03:24:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-17 03:24:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-11-17 03:24:01,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5483870967741935 [2024-11-17 03:24:01,997 INFO L175 Difference]: Start difference. First operand has 131 places, 116 transitions, 552 flow. Second operand 4 states and 272 transitions. [2024-11-17 03:24:01,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 166 transitions, 1032 flow [2024-11-17 03:24:02,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 166 transitions, 1008 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-17 03:24:02,010 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 648 flow [2024-11-17 03:24:02,010 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=648, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-11-17 03:24:02,010 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 16 predicate places. [2024-11-17 03:24:02,011 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 648 flow [2024-11-17 03:24:02,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:02,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:24:02,011 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:24:02,018 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-17 03:24:02,211 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-17 03:24:02,212 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:24:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:24:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1976672781, now seen corresponding path program 1 times [2024-11-17 03:24:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:24:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296183159] [2024-11-17 03:24:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:24:02,213 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-17 03:24:02,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:24:02,216 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-17 03:24:02,218 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-17 03:24:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:24:02,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:24:02,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:24:02,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:02,380 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:02,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:02,383 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-17 03:24:02,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 03:24:02,418 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-17 03:24:02,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 03:24:02,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 49 [2024-11-17 03:24:02,456 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-17 03:24:02,456 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:24:02,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:24:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296183159] [2024-11-17 03:24:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296183159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:24:02,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:24:02,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:24:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370667059] [2024-11-17 03:24:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:24:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:24:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:24:02,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:24:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:24:02,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-17 03:24:02,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 648 flow. Second operand has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:02,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:24:02,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-17 03:24:02,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:24:03,967 INFO L124 PetriNetUnfolderBase]: 5472/9513 cut-off events. [2024-11-17 03:24:03,967 INFO L125 PetriNetUnfolderBase]: For 15228/15232 co-relation queries the response was YES. [2024-11-17 03:24:03,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29135 conditions, 9513 events. 5472/9513 cut-off events. For 15228/15232 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 67231 event pairs, 3473 based on Foata normal form. 123/9606 useless extension candidates. Maximal degree in co-relation 26344. Up to 8006 conditions per place. [2024-11-17 03:24:04,012 INFO L140 encePairwiseOnDemand]: 115/124 looper letters, 132 selfloop transitions, 18 changer transitions 0/178 dead transitions. [2024-11-17 03:24:04,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 178 transitions, 1179 flow [2024-11-17 03:24:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:24:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:24:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 314 transitions. [2024-11-17 03:24:04,013 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5064516129032258 [2024-11-17 03:24:04,013 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 648 flow. Second operand 5 states and 314 transitions. [2024-11-17 03:24:04,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 178 transitions, 1179 flow [2024-11-17 03:24:04,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 178 transitions, 1179 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-17 03:24:04,034 INFO L231 Difference]: Finished difference. Result has 141 places, 142 transitions, 833 flow [2024-11-17 03:24:04,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=833, PETRI_PLACES=141, PETRI_TRANSITIONS=142} [2024-11-17 03:24:04,034 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-11-17 03:24:04,034 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 142 transitions, 833 flow [2024-11-17 03:24:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.5) internal successors, (170), 4 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:04,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:24:04,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:24:04,047 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-17 03:24:04,235 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-17 03:24:04,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:24:04,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:24:04,236 INFO L85 PathProgramCache]: Analyzing trace with hash 647577730, now seen corresponding path program 1 times [2024-11-17 03:24:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:24:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018565131] [2024-11-17 03:24:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:24:04,237 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-17 03:24:04,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:24:04,241 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-17 03:24:04,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 (16)] Waiting until timeout for monitored process [2024-11-17 03:24:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:24:04,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 03:24:04,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:24:04,392 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-17 03:24:04,397 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-17 03:24:04,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:04,506 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-17 03:24:04,516 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 03:24:04,516 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-17 03:24:04,527 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-17 03:24:04,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:24:04,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:24:04,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018565131] [2024-11-17 03:24:04,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018565131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:24:04,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:24:04,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:24:04,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526719107] [2024-11-17 03:24:04,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:24:04,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:24:04,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:24:04,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:24:04,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:24:04,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:24:04,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 142 transitions, 833 flow. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:04,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:24:04,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:24:04,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:24:06,078 INFO L124 PetriNetUnfolderBase]: 5180/9367 cut-off events. [2024-11-17 03:24:06,078 INFO L125 PetriNetUnfolderBase]: For 20063/20069 co-relation queries the response was YES. [2024-11-17 03:24:06,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30128 conditions, 9367 events. 5180/9367 cut-off events. For 20063/20069 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 68034 event pairs, 1477 based on Foata normal form. 436/9777 useless extension candidates. Maximal degree in co-relation 28684. Up to 4834 conditions per place. [2024-11-17 03:24:06,128 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 203 selfloop transitions, 22 changer transitions 0/255 dead transitions. [2024-11-17 03:24:06,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 255 transitions, 1832 flow [2024-11-17 03:24:06,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:24:06,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:24:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 551 transitions. [2024-11-17 03:24:06,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49372759856630827 [2024-11-17 03:24:06,130 INFO L175 Difference]: Start difference. First operand has 141 places, 142 transitions, 833 flow. Second operand 9 states and 551 transitions. [2024-11-17 03:24:06,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 255 transitions, 1832 flow [2024-11-17 03:24:06,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 255 transitions, 1799 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-11-17 03:24:06,166 INFO L231 Difference]: Finished difference. Result has 145 places, 140 transitions, 851 flow [2024-11-17 03:24:06,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=851, PETRI_PLACES=145, PETRI_TRANSITIONS=140} [2024-11-17 03:24:06,166 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 27 predicate places. [2024-11-17 03:24:06,166 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 140 transitions, 851 flow [2024-11-17 03:24:06,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:06,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:24:06,167 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:24:06,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-17 03:24:06,367 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-17 03:24:06,367 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:24:06,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:24:06,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2017867966, now seen corresponding path program 1 times [2024-11-17 03:24:06,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:24:06,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914669980] [2024-11-17 03:24:06,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:24:06,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 03:24:06,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:24:06,369 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-17 03:24:06,370 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-17 03:24:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:24:06,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 03:24:06,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:24:06,526 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-17 03:24:06,530 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-17 03:24:06,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:06,617 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-17 03:24:06,624 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 03:24:06,624 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-17 03:24:06,633 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-17 03:24:06,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:24:06,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:24:06,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914669980] [2024-11-17 03:24:06,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914669980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:24:06,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:24:06,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 03:24:06,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031208565] [2024-11-17 03:24:06,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:24:06,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 03:24:06,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:24:06,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 03:24:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 03:24:06,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 124 [2024-11-17 03:24:06,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 140 transitions, 851 flow. Second operand has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:06,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:24:06,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 124 [2024-11-17 03:24:06,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:24:08,196 INFO L124 PetriNetUnfolderBase]: 5447/9936 cut-off events. [2024-11-17 03:24:08,196 INFO L125 PetriNetUnfolderBase]: For 22352/22356 co-relation queries the response was YES. [2024-11-17 03:24:08,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31846 conditions, 9936 events. 5447/9936 cut-off events. For 22352/22356 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 73626 event pairs, 1714 based on Foata normal form. 328/10244 useless extension candidates. Maximal degree in co-relation 30424. Up to 4020 conditions per place. [2024-11-17 03:24:08,257 INFO L140 encePairwiseOnDemand]: 112/124 looper letters, 207 selfloop transitions, 22 changer transitions 0/259 dead transitions. [2024-11-17 03:24:08,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 259 transitions, 1903 flow [2024-11-17 03:24:08,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 03:24:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-17 03:24:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 552 transitions. [2024-11-17 03:24:08,259 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4946236559139785 [2024-11-17 03:24:08,259 INFO L175 Difference]: Start difference. First operand has 145 places, 140 transitions, 851 flow. Second operand 9 states and 552 transitions. [2024-11-17 03:24:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 259 transitions, 1903 flow [2024-11-17 03:24:08,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 259 transitions, 1854 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-17 03:24:08,300 INFO L231 Difference]: Finished difference. Result has 143 places, 138 transitions, 853 flow [2024-11-17 03:24:08,301 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=853, PETRI_PLACES=143, PETRI_TRANSITIONS=138} [2024-11-17 03:24:08,301 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 25 predicate places. [2024-11-17 03:24:08,301 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 138 transitions, 853 flow [2024-11-17 03:24:08,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.166666666666664) internal successors, (265), 6 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:08,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:24:08,301 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:24:08,308 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-17 03:24:08,502 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-17 03:24:08,502 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:24:08,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:24:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash -149247090, now seen corresponding path program 1 times [2024-11-17 03:24:08,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:24:08,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686450568] [2024-11-17 03:24:08,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:24:08,503 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-17 03:24:08,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:24:08,504 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-17 03:24:08,505 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-17 03:24:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:24:08,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 03:24:08,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:24:08,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:08,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:08,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 03:24:08,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:08,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:08,675 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-17 03:24:08,712 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-17 03:24:08,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:24:08,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:24:08,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686450568] [2024-11-17 03:24:08,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686450568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:24:08,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:24:08,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 03:24:08,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465985497] [2024-11-17 03:24:08,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:24:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 03:24:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:24:08,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 03:24:08,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 03:24:08,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 124 [2024-11-17 03:24:08,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 138 transitions, 853 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:08,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:24:08,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 124 [2024-11-17 03:24:08,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:24:09,989 INFO L124 PetriNetUnfolderBase]: 5957/10440 cut-off events. [2024-11-17 03:24:09,990 INFO L125 PetriNetUnfolderBase]: For 24199/24201 co-relation queries the response was YES. [2024-11-17 03:24:10,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34844 conditions, 10440 events. 5957/10440 cut-off events. For 24199/24201 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 75146 event pairs, 4048 based on Foata normal form. 120/10523 useless extension candidates. Maximal degree in co-relation 33423. Up to 8759 conditions per place. [2024-11-17 03:24:10,054 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 119 selfloop transitions, 18 changer transitions 0/164 dead transitions. [2024-11-17 03:24:10,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 164 transitions, 1279 flow [2024-11-17 03:24:10,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 03:24:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-17 03:24:10,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2024-11-17 03:24:10,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.532258064516129 [2024-11-17 03:24:10,055 INFO L175 Difference]: Start difference. First operand has 143 places, 138 transitions, 853 flow. Second operand 3 states and 198 transitions. [2024-11-17 03:24:10,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 164 transitions, 1279 flow [2024-11-17 03:24:10,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 164 transitions, 1244 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-17 03:24:10,093 INFO L231 Difference]: Finished difference. Result has 141 places, 149 transitions, 1015 flow [2024-11-17 03:24:10,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1015, PETRI_PLACES=141, PETRI_TRANSITIONS=149} [2024-11-17 03:24:10,093 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 23 predicate places. [2024-11-17 03:24:10,093 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 149 transitions, 1015 flow [2024-11-17 03:24:10,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 03:24:10,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:24:10,093 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:24:10,101 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 (18)] Forceful destruction successful, exit code 0 [2024-11-17 03:24:10,294 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-17 03:24:10,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:24:10,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:24:10,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1275304018, now seen corresponding path program 1 times [2024-11-17 03:24:10,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:24:10,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064772664] [2024-11-17 03:24:10,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:24:10,295 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-17 03:24:10,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:24:10,296 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-17 03:24:10,297 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-17 03:24:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 03:24:10,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 03:24:10,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 03:24:10,447 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:10,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:10,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 03:24:10,449 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-17 03:24:10,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 03:24:10,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 121 treesize of output 49 [2024-11-17 03:24:10,511 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-17 03:24:10,511 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 03:24:10,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 03:24:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064772664] [2024-11-17 03:24:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064772664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 03:24:10,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 03:24:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 03:24:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205616521] [2024-11-17 03:24:10,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 03:24:10,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 03:24:10,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 03:24:10,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 03:24:10,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 03:24:10,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 124 [2024-11-17 03:24:10,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 149 transitions, 1015 flow. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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-17 03:24:10,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-17 03:24:10,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 124 [2024-11-17 03:24:10,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-17 03:24:12,309 INFO L124 PetriNetUnfolderBase]: 6329/11366 cut-off events. [2024-11-17 03:24:12,309 INFO L125 PetriNetUnfolderBase]: For 34320/34322 co-relation queries the response was YES. [2024-11-17 03:24:12,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40018 conditions, 11366 events. 6329/11366 cut-off events. For 34320/34322 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 85738 event pairs, 4013 based on Foata normal form. 177/11511 useless extension candidates. Maximal degree in co-relation 37860. Up to 9066 conditions per place. [2024-11-17 03:24:12,368 INFO L140 encePairwiseOnDemand]: 116/124 looper letters, 147 selfloop transitions, 34 changer transitions 0/209 dead transitions. [2024-11-17 03:24:12,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 209 transitions, 1805 flow [2024-11-17 03:24:12,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 03:24:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-17 03:24:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2024-11-17 03:24:12,370 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4967741935483871 [2024-11-17 03:24:12,370 INFO L175 Difference]: Start difference. First operand has 141 places, 149 transitions, 1015 flow. Second operand 5 states and 308 transitions. [2024-11-17 03:24:12,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 209 transitions, 1805 flow [2024-11-17 03:24:12,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 209 transitions, 1753 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-11-17 03:24:12,443 INFO L231 Difference]: Finished difference. Result has 146 places, 172 transitions, 1374 flow [2024-11-17 03:24:12,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=124, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1374, PETRI_PLACES=146, PETRI_TRANSITIONS=172} [2024-11-17 03:24:12,444 INFO L277 CegarLoopForPetriNet]: 118 programPoint places, 28 predicate places. [2024-11-17 03:24:12,444 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 172 transitions, 1374 flow [2024-11-17 03:24:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 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-17 03:24:12,444 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-17 03:24:12,444 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-17 03:24:12,451 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-17 03:24:12,648 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-17 03:24:12,648 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 52 more)] === [2024-11-17 03:24:12,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 03:24:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1624583550, now seen corresponding path program 1 times [2024-11-17 03:24:12,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 03:24:12,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284538446] [2024-11-17 03:24:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 03:24:12,650 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-17 03:24:12,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 03:24:12,651 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-17 03:24:12,652 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-17 03:24:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:24:12,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 03:24:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 03:24:12,977 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-17 03:24:12,977 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-17 03:24:12,978 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (54 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (51 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 55 remaining) [2024-11-17 03:24:12,979 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 55 remaining) [2024-11-17 03:24:12,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 55 remaining) [2024-11-17 03:24:12,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 55 remaining) [2024-11-17 03:24:12,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 55 remaining) [2024-11-17 03:24:12,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 55 remaining) [2024-11-17 03:24:12,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (34 of 55 remaining) [2024-11-17 03:24:12,981 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (29 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (24 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 55 remaining) [2024-11-17 03:24:12,982 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (21 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (20 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 55 remaining) [2024-11-17 03:24:12,983 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 55 remaining) [2024-11-17 03:24:12,984 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 55 remaining) [2024-11-17 03:24:12,985 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location my_callbackErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 55 remaining) [2024-11-17 03:24:12,994 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-17 03:24:13,185 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-17 03:24:13,186 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 03:24:13,223 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-17 03:24:13,223 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-17 03:24:13,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:24:13 BasicIcfg [2024-11-17 03:24:13,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-17 03:24:13,227 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 03:24:13,227 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 03:24:13,227 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 03:24:13,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 03:23:38" (3/4) ... [2024-11-17 03:24:13,229 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 03:24:13,230 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 03:24:13,231 INFO L158 Benchmark]: Toolchain (without parser) took 36734.29ms. Allocated memory was 83.9MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 53.3MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-17 03:24:13,231 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 60.8MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:24:13,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 632.22ms. Allocated memory is still 83.9MB. Free memory was 53.1MB in the beginning and 47.5MB in the end (delta: 5.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-17 03:24:13,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.56ms. Allocated memory is still 83.9MB. Free memory was 47.5MB in the beginning and 44.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:24:13,233 INFO L158 Benchmark]: Boogie Preprocessor took 54.80ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 39.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-17 03:24:13,235 INFO L158 Benchmark]: IcfgBuilder took 1061.37ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 39.3MB in the beginning and 67.5MB in the end (delta: -28.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-17 03:24:13,235 INFO L158 Benchmark]: TraceAbstraction took 34920.44ms. Allocated memory was 102.8MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 66.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-17 03:24:13,235 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 4.2GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 03:24:13,236 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.81ms. Allocated memory is still 60.8MB. Free memory is still 44.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 632.22ms. Allocated memory is still 83.9MB. Free memory was 53.1MB in the beginning and 47.5MB in the end (delta: 5.6MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.56ms. Allocated memory is still 83.9MB. Free memory was 47.5MB in the beginning and 44.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.80ms. Allocated memory is still 83.9MB. Free memory was 44.5MB in the beginning and 39.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1061.37ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 39.3MB in the beginning and 67.5MB in the end (delta: -28.1MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34920.44ms. Allocated memory was 102.8MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 66.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 4.2GB. Free memory is still 2.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of large string literal at line 3883, overapproximation of memtrack at line 3883. Possible FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 VAL [t1=0, t2=0] [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, d={-2147483648:24}, data={-2147483648:0}, res=0, t1=0, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, arg={-2147483648:24}, d={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, res=0, t1=0, t2=1] [L3931] 0 return 0; VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, \result=0, arg={-2147483648:24}, d={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, res=0, t1=0, t2=1] [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\old(arg)={-2147483648:24}, \old(data)={-2147483648:0}, arg={-2147483648:24}, data={-2147483648:0}, data={-2147483648:0}, dev={-2147483648:24}, status={3:0}, t1=0, t2=1] [L3940] 0 data->shared.a = 3 VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] [L3943] 0 data->shared.b = 3 VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] [L3907] 1 data->shared.a = 1 VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] [L3946] EXPR 0 data->shared.a [L3946] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] CALL 0 reach_error() [L3883] 0 (0) ? (void) (0) : __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) [L3883] 0 __assert_fail ("0", "../sv-benchmarks/c/ldv-races/race-2_4-container_of.c", 13, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={-2147483648:24}, arg={-2147483648:24}, data={-2147483648:0}, dev={-2147483648:24}, t1=0, t2=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3961]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3883]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 3929]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 3930]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 131 locations, 55 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 34.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2481 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2012 mSDsluCounter, 133 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5446 IncrementalHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 110 mSDtfsCounter, 5446 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374occurred in iteration=18, InterpolantAutomatonStates: 92, 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.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 176 ConstructedInterpolants, 1 QuantifiedInterpolants, 1562 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1840 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-17 03:24:13,269 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