./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.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 c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:28:31,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:28:31,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:28:31,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:28:31,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:28:31,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:28:31,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:28:31,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:28:31,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:28:31,448 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:28:31,448 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:28:31,448 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:28:31,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:28:31,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:28:31,449 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:28:31,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:28:31,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:28:31,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:28:31,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:28:31,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:28:31,452 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:28:31,454 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:28:31,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:28:31,456 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:28:31,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:28:31,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:28:31,456 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:28:31,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:28:31,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:28:31,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:28:31,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:28:31,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:28:31,457 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:28:31,457 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:28:31,457 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:28:31,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:28:31,460 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 -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2024-10-13 12:28:31,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:28:31,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:28:31,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:28:31,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:28:31,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:28:31,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2024-10-13 12:28:33,200 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:28:33,490 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:28:33,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2024-10-13 12:28:33,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc69026f/276b820150b547f083e4fb7dcaef8b90/FLAG61c9f62ac [2024-10-13 12:28:33,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbc69026f/276b820150b547f083e4fb7dcaef8b90 [2024-10-13 12:28:33,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:28:33,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:28:33,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:28:33,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:28:33,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:28:33,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:33" (1/1) ... [2024-10-13 12:28:33,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11dccfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:33, skipping insertion in model container [2024-10-13 12:28:33,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:33" (1/1) ... [2024-10-13 12:28:33,590 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:28:33,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:28:33,921 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-13 12:28:33,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3968f890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:33, skipping insertion in model container [2024-10-13 12:28:33,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:28:33,922 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:28:33,924 INFO L158 Benchmark]: Toolchain (without parser) took 388.46ms. Allocated memory is still 190.8MB. Free memory was 120.9MB in the beginning and 101.7MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 12:28:33,924 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 109.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:33,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.61ms. Allocated memory is still 190.8MB. Free memory was 120.7MB in the beginning and 101.7MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 12:28:33,925 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.10ms. Allocated memory is still 109.1MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.61ms. Allocated memory is still 190.8MB. Free memory was 120.7MB in the beginning and 101.7MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 3005]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.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 c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:28:35,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:28:35,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:28:35,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:28:35,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:28:35,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:28:35,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:28:35,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:28:35,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:28:35,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:28:35,999 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:28:35,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:28:36,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:28:36,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:28:36,001 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:28:36,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:28:36,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:28:36,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:28:36,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:28:36,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:28:36,002 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:28:36,004 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:28:36,004 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:28:36,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:28:36,005 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:28:36,005 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:28:36,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:28:36,005 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:28:36,005 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:28:36,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:28:36,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:28:36,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:28:36,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:28:36,007 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:28:36,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:28:36,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:28:36,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:28:36,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:28:36,008 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:28:36,008 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:28:36,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:28:36,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:28:36,009 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:28:36,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:28:36,009 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:28:36,009 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 -> c74b9abfd84bef3aa9e712193319c6938e59ac72c91a2b202dc32aee3a54e2e3 [2024-10-13 12:28:36,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:28:36,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:28:36,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:28:36,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:28:36,436 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:28:36,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2024-10-13 12:28:37,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:28:38,217 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:28:38,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_06-ptra_nr.i [2024-10-13 12:28:38,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed1dd4081/6e5cbfaa3e9a4703a624d1fedc6f75d3/FLAG312a1af7e [2024-10-13 12:28:38,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed1dd4081/6e5cbfaa3e9a4703a624d1fedc6f75d3 [2024-10-13 12:28:38,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:28:38,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:28:38,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:28:38,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:28:38,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:28:38,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d24d7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38, skipping insertion in model container [2024-10-13 12:28:38,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:28:38,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:28:38,746 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:28:38,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:28:38,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:28:38,803 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:28:38,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:28:38,888 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:28:38,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38 WrapperNode [2024-10-13 12:28:38,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:28:38,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:28:38,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:28:38,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:28:38,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,944 INFO L138 Inliner]: procedures = 190, calls = 29, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 100 [2024-10-13 12:28:38,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:28:38,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:28:38,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:28:38,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:28:38,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,987 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [5, 14]. 74 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [5, 0]. The 11 writes are split as follows [0, 11]. [2024-10-13 12:28:38,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:38,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:39,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:39,009 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:39,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:39,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:39,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:28:39,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:28:39,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:28:39,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:28:39,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (1/1) ... [2024-10-13 12:28:39,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:28:39,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:28:39,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 12:28:39,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 12:28:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:28:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:28:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:28:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:28:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:28:39,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-13 12:28:39,089 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:28:39,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 12:28:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 12:28:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:28:39,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:28:39,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:28:39,091 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 12:28:39,243 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:28:39,245 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:28:39,626 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:28:39,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:28:39,796 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:28:39,797 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 12:28:39,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:39 BoogieIcfgContainer [2024-10-13 12:28:39,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:28:39,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:28:39,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:28:39,805 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:28:39,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:28:38" (1/3) ... [2024-10-13 12:28:39,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164927cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:28:39, skipping insertion in model container [2024-10-13 12:28:39,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:28:38" (2/3) ... [2024-10-13 12:28:39,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164927cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:28:39, skipping insertion in model container [2024-10-13 12:28:39,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:39" (3/3) ... [2024-10-13 12:28:39,810 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_06-ptra_nr.i [2024-10-13 12:28:39,841 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:28:39,845 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-10-13 12:28:39,845 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:28:39,918 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 12:28:39,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 57 transitions, 118 flow [2024-10-13 12:28:40,002 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2024-10-13 12:28:40,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:28:40,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 56 events. 0/56 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-10-13 12:28:40,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 57 transitions, 118 flow [2024-10-13 12:28:40,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 115 flow [2024-10-13 12:28:40,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:28:40,030 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;@52da1177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:28:40,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 40 error locations. [2024-10-13 12:28:40,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:28:40,036 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-10-13 12:28:40,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:28:40,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:40,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-13 12:28:40,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:40,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:40,044 INFO L85 PathProgramCache]: Analyzing trace with hash 9771, now seen corresponding path program 1 times [2024-10-13 12:28:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:40,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [101076489] [2024-10-13 12:28:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:40,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:40,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:40,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:40,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 12:28:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:40,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:28:40,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:40,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:28:40,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:40,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:40,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:40,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [101076489] [2024-10-13 12:28:40,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [101076489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:40,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:40,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:28:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665161265] [2024-10-13 12:28:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:40,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:40,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:40,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2024-10-13 12:28:40,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:40,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:40,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2024-10-13 12:28:40,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:40,502 INFO L124 PetriNetUnfolderBase]: 42/176 cut-off events. [2024-10-13 12:28:40,503 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:28:40,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 176 events. 42/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 748 event pairs, 42 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 256. Up to 101 conditions per place. [2024-10-13 12:28:40,507 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 18 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2024-10-13 12:28:40,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 147 flow [2024-10-13 12:28:40,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2024-10-13 12:28:40,526 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.672514619883041 [2024-10-13 12:28:40,528 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 115 flow. Second operand 3 states and 115 transitions. [2024-10-13 12:28:40,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 147 flow [2024-10-13 12:28:40,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:40,535 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 110 flow [2024-10-13 12:28:40,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-10-13 12:28:40,546 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-10-13 12:28:40,547 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 110 flow [2024-10-13 12:28:40,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:40,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:40,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-10-13 12:28:40,555 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-10-13 12:28:40,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:40,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 9772, now seen corresponding path program 1 times [2024-10-13 12:28:40,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:40,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821529346] [2024-10-13 12:28:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:40,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:40,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:40,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:40,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 12:28:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:40,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:28:40,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:40,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:28:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:40,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:40,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821529346] [2024-10-13 12:28:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821529346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:40,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:40,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 12:28:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713857513] [2024-10-13 12:28:40,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:40,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:40,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:40,989 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 57 [2024-10-13 12:28:40,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:40,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:40,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 57 [2024-10-13 12:28:40,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:41,093 INFO L124 PetriNetUnfolderBase]: 42/170 cut-off events. [2024-10-13 12:28:41,093 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:28:41,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 170 events. 42/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 744 event pairs, 42 based on Foata normal form. 5/142 useless extension candidates. Maximal degree in co-relation 260. Up to 101 conditions per place. [2024-10-13 12:28:41,097 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 15 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-10-13 12:28:41,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 136 flow [2024-10-13 12:28:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 121 transitions. [2024-10-13 12:28:41,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7076023391812866 [2024-10-13 12:28:41,100 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 110 flow. Second operand 3 states and 121 transitions. [2024-10-13 12:28:41,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 136 flow [2024-10-13 12:28:41,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:41,103 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 98 flow [2024-10-13 12:28:41,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-10-13 12:28:41,104 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -11 predicate places. [2024-10-13 12:28:41,104 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 98 flow [2024-10-13 12:28:41,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:41,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:41,105 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:28:41,112 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-10-13 12:28:41,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:41,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:41,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash 442048008, now seen corresponding path program 1 times [2024-10-13 12:28:41,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:41,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111469357] [2024-10-13 12:28:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:41,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:41,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:41,309 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:41,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 12:28:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:41,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:28:41,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:41,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:28:41,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:41,438 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:41,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:41,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111469357] [2024-10-13 12:28:41,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111469357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:41,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:41,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:28:41,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177392373] [2024-10-13 12:28:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:41,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:41,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:41,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:41,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:41,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 57 [2024-10-13 12:28:41,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:41,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:41,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 57 [2024-10-13 12:28:41,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:41,596 INFO L124 PetriNetUnfolderBase]: 49/176 cut-off events. [2024-10-13 12:28:41,596 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 12:28:41,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303 conditions, 176 events. 49/176 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 731 event pairs, 49 based on Foata normal form. 1/157 useless extension candidates. Maximal degree in co-relation 282. Up to 117 conditions per place. [2024-10-13 12:28:41,598 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 19 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2024-10-13 12:28:41,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 130 flow [2024-10-13 12:28:41,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:41,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2024-10-13 12:28:41,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7192982456140351 [2024-10-13 12:28:41,600 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 98 flow. Second operand 3 states and 123 transitions. [2024-10-13 12:28:41,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 130 flow [2024-10-13 12:28:41,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:41,602 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 84 flow [2024-10-13 12:28:41,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-10-13 12:28:41,603 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -15 predicate places. [2024-10-13 12:28:41,603 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 84 flow [2024-10-13 12:28:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:41,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:41,604 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:28:41,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 12:28:41,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:41,805 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:41,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:41,806 INFO L85 PathProgramCache]: Analyzing trace with hash 442048009, now seen corresponding path program 1 times [2024-10-13 12:28:41,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922814184] [2024-10-13 12:28:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:41,810 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:41,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 12:28:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:41,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:28:41,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:41,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:28:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:41,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:41,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:41,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922814184] [2024-10-13 12:28:41,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922814184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:41,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:41,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:28:41,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758199918] [2024-10-13 12:28:41,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:41,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:41,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:41,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:41,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:42,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 57 [2024-10-13 12:28:42,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:42,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:42,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 57 [2024-10-13 12:28:42,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:42,145 INFO L124 PetriNetUnfolderBase]: 42/146 cut-off events. [2024-10-13 12:28:42,146 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:28:42,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 146 events. 42/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 555 event pairs, 42 based on Foata normal form. 8/137 useless extension candidates. Maximal degree in co-relation 246. Up to 102 conditions per place. [2024-10-13 12:28:42,148 INFO L140 encePairwiseOnDemand]: 52/57 looper letters, 18 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2024-10-13 12:28:42,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 114 flow [2024-10-13 12:28:42,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2024-10-13 12:28:42,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7309941520467836 [2024-10-13 12:28:42,152 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 84 flow. Second operand 3 states and 125 transitions. [2024-10-13 12:28:42,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 114 flow [2024-10-13 12:28:42,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 113 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:42,154 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 77 flow [2024-10-13 12:28:42,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-10-13 12:28:42,156 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -18 predicate places. [2024-10-13 12:28:42,156 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 77 flow [2024-10-13 12:28:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:42,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:42,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:42,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 12:28:42,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:42,358 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash -968343735, now seen corresponding path program 1 times [2024-10-13 12:28:42,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:42,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741353794] [2024-10-13 12:28:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:42,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:42,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 12:28:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:42,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:28:42,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:42,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:28:42,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:42,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:42,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:42,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741353794] [2024-10-13 12:28:42,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741353794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:42,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:42,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:28:42,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895005963] [2024-10-13 12:28:42,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:42,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:42,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:42,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:42,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:42,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 57 [2024-10-13 12:28:42,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:42,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:42,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 57 [2024-10-13 12:28:42,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:42,732 INFO L124 PetriNetUnfolderBase]: 49/168 cut-off events. [2024-10-13 12:28:42,733 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:28:42,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 168 events. 49/168 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 690 event pairs, 35 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 283. Up to 89 conditions per place. [2024-10-13 12:28:42,734 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 25 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2024-10-13 12:28:42,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 141 flow [2024-10-13 12:28:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:42,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-10-13 12:28:42,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.783625730994152 [2024-10-13 12:28:42,736 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 77 flow. Second operand 3 states and 134 transitions. [2024-10-13 12:28:42,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 141 flow [2024-10-13 12:28:42,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 140 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:28:42,737 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2024-10-13 12:28:42,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-10-13 12:28:42,738 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -19 predicate places. [2024-10-13 12:28:42,738 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2024-10-13 12:28:42,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:42,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:42,739 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:42,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 12:28:42,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:42,944 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:42,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:42,945 INFO L85 PathProgramCache]: Analyzing trace with hash -968343734, now seen corresponding path program 1 times [2024-10-13 12:28:42,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:42,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684018972] [2024-10-13 12:28:42,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:42,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:42,949 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:42,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-13 12:28:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:43,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:28:43,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:43,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:28:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:43,134 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:43,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:43,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684018972] [2024-10-13 12:28:43,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684018972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:43,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:43,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:28:43,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100582879] [2024-10-13 12:28:43,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:43,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:28:43,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:43,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:28:43,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:28:43,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 57 [2024-10-13 12:28:43,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:43,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:43,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 57 [2024-10-13 12:28:43,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:43,335 INFO L124 PetriNetUnfolderBase]: 42/141 cut-off events. [2024-10-13 12:28:43,336 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-13 12:28:43,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 141 events. 42/141 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 513 event pairs, 26 based on Foata normal form. 16/144 useless extension candidates. Maximal degree in co-relation 257. Up to 89 conditions per place. [2024-10-13 12:28:43,337 INFO L140 encePairwiseOnDemand]: 53/57 looper letters, 24 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-10-13 12:28:43,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 39 transitions, 138 flow [2024-10-13 12:28:43,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2024-10-13 12:28:43,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7953216374269005 [2024-10-13 12:28:43,339 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 136 transitions. [2024-10-13 12:28:43,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 39 transitions, 138 flow [2024-10-13 12:28:43,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 39 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:43,340 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 72 flow [2024-10-13 12:28:43,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2024-10-13 12:28:43,341 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -21 predicate places. [2024-10-13 12:28:43,341 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 72 flow [2024-10-13 12:28:43,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:43,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:43,342 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:43,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 12:28:43,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:43,546 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1358177777, now seen corresponding path program 1 times [2024-10-13 12:28:43,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:43,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028519640] [2024-10-13 12:28:43,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:43,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:43,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:43,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-13 12:28:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:43,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:28:43,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:43,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:28:43,780 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-10-13 12:28:43,781 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 16 treesize of output 17 [2024-10-13 12:28:43,820 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-13 12:28:43,821 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 18 treesize of output 28 [2024-10-13 12:28:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:43,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:43,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:43,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028519640] [2024-10-13 12:28:43,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028519640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:43,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:43,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:28:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676962915] [2024-10-13 12:28:43,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:43,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:28:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:28:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:28:44,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 57 [2024-10-13 12:28:44,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:44,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:44,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 57 [2024-10-13 12:28:44,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:44,252 INFO L124 PetriNetUnfolderBase]: 63/179 cut-off events. [2024-10-13 12:28:44,252 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 12:28:44,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 179 events. 63/179 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 633 event pairs, 54 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 342. Up to 132 conditions per place. [2024-10-13 12:28:44,254 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 29 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2024-10-13 12:28:44,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 40 transitions, 160 flow [2024-10-13 12:28:44,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2024-10-13 12:28:44,255 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7485380116959064 [2024-10-13 12:28:44,255 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 72 flow. Second operand 3 states and 128 transitions. [2024-10-13 12:28:44,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 40 transitions, 160 flow [2024-10-13 12:28:44,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 40 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:44,256 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 70 flow [2024-10-13 12:28:44,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2024-10-13 12:28:44,257 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -22 predicate places. [2024-10-13 12:28:44,257 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 70 flow [2024-10-13 12:28:44,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:44,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:44,257 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:44,265 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-10-13 12:28:44,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:44,459 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:44,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:44,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1358177778, now seen corresponding path program 1 times [2024-10-13 12:28:44,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:44,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143222284] [2024-10-13 12:28:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:44,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:44,465 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:44,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-13 12:28:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:44,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:28:44,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:44,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:28:44,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:28:44,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:28:44,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 12:28:44,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:28:44,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-13 12:28:44,864 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 12:28:44,864 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 12 treesize of output 14 [2024-10-13 12:28:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:44,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:44,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:44,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143222284] [2024-10-13 12:28:44,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143222284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:44,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:44,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:28:44,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993906136] [2024-10-13 12:28:44,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:44,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:28:44,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:44,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:28:44,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:28:45,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 57 [2024-10-13 12:28:45,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:45,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:45,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 57 [2024-10-13 12:28:45,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:45,150 INFO L124 PetriNetUnfolderBase]: 42/136 cut-off events. [2024-10-13 12:28:45,151 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-13 12:28:45,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 136 events. 42/136 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 484 event pairs, 36 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 243. Up to 90 conditions per place. [2024-10-13 12:28:45,152 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 21 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2024-10-13 12:28:45,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 130 flow [2024-10-13 12:28:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:28:45,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:28:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2024-10-13 12:28:45,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.783625730994152 [2024-10-13 12:28:45,153 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 70 flow. Second operand 3 states and 134 transitions. [2024-10-13 12:28:45,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 130 flow [2024-10-13 12:28:45,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:45,154 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 68 flow [2024-10-13 12:28:45,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2024-10-13 12:28:45,155 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -23 predicate places. [2024-10-13 12:28:45,155 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 68 flow [2024-10-13 12:28:45,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:45,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:45,155 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:45,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 12:28:45,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:45,356 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:45,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1495166064, now seen corresponding path program 1 times [2024-10-13 12:28:45,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:45,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407619764] [2024-10-13 12:28:45,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:45,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:45,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-13 12:28:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:45,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:28:45,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:45,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-13 12:28:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:45,534 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:45,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:45,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407619764] [2024-10-13 12:28:45,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407619764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:45,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:45,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:28:45,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450349832] [2024-10-13 12:28:45,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:45,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:28:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:45,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:28:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:28:45,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 57 [2024-10-13 12:28:45,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:45,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:45,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 57 [2024-10-13 12:28:45,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:45,774 INFO L124 PetriNetUnfolderBase]: 49/155 cut-off events. [2024-10-13 12:28:45,775 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 12:28:45,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 155 events. 49/155 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 536 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 278. Up to 90 conditions per place. [2024-10-13 12:28:45,777 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 32 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2024-10-13 12:28:45,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 166 flow [2024-10-13 12:28:45,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:28:45,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:28:45,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2024-10-13 12:28:45,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7850877192982456 [2024-10-13 12:28:45,778 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 68 flow. Second operand 4 states and 179 transitions. [2024-10-13 12:28:45,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 166 flow [2024-10-13 12:28:45,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:45,779 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 66 flow [2024-10-13 12:28:45,779 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2024-10-13 12:28:45,779 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -23 predicate places. [2024-10-13 12:28:45,779 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 66 flow [2024-10-13 12:28:45,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:45,780 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:45,780 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:45,792 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-10-13 12:28:45,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:45,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:45,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1495166063, now seen corresponding path program 1 times [2024-10-13 12:28:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807510925] [2024-10-13 12:28:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:45,983 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:45,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-13 12:28:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:28:46,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 12:28:46,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:28:46,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:28:46,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:28:46,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:28:46,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:28:46,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807510925] [2024-10-13 12:28:46,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807510925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:28:46,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:28:46,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:28:46,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926700845] [2024-10-13 12:28:46,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:28:46,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:28:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:28:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:28:46,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:28:46,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 57 [2024-10-13 12:28:46,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:46,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:28:46,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 57 [2024-10-13 12:28:46,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:28:46,591 INFO L124 PetriNetUnfolderBase]: 42/140 cut-off events. [2024-10-13 12:28:46,591 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-13 12:28:46,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 140 events. 42/140 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 465 event pairs, 0 based on Foata normal form. 8/148 useless extension candidates. Maximal degree in co-relation 256. Up to 75 conditions per place. [2024-10-13 12:28:46,592 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 28 selfloop transitions, 2 changer transitions 3/42 dead transitions. [2024-10-13 12:28:46,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 158 flow [2024-10-13 12:28:46,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:28:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:28:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2024-10-13 12:28:46,594 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7982456140350878 [2024-10-13 12:28:46,594 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 66 flow. Second operand 4 states and 182 transitions. [2024-10-13 12:28:46,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 158 flow [2024-10-13 12:28:46,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 155 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:28:46,595 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 63 flow [2024-10-13 12:28:46,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2024-10-13 12:28:46,595 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -23 predicate places. [2024-10-13 12:28:46,595 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 63 flow [2024-10-13 12:28:46,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 12:28:46,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:28:46,596 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:46,602 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 (11)] Ended with exit code 0 [2024-10-13 12:28:46,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:46,796 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 37 more)] === [2024-10-13 12:28:46,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:28:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1412427738, now seen corresponding path program 1 times [2024-10-13 12:28:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:28:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803307681] [2024-10-13 12:28:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:28:46,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:46,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:28:46,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:28:46,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-13 12:28:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:28:47,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 12:28:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 12:28:47,288 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-13 12:28:47,289 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 12:28:47,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (39 of 40 remaining) [2024-10-13 12:28:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 40 remaining) [2024-10-13 12:28:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 40 remaining) [2024-10-13 12:28:47,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 40 remaining) [2024-10-13 12:28:47,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 40 remaining) [2024-10-13 12:28:47,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 40 remaining) [2024-10-13 12:28:47,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 40 remaining) [2024-10-13 12:28:47,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 40 remaining) [2024-10-13 12:28:47,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 40 remaining) [2024-10-13 12:28:47,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 40 remaining) [2024-10-13 12:28:47,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 40 remaining) [2024-10-13 12:28:47,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 40 remaining) [2024-10-13 12:28:47,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-10-13 12:28:47,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:28:47,497 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:28:47,561 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 12:28:47,561 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 12:28:47,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:28:47 BasicIcfg [2024-10-13 12:28:47,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 12:28:47,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 12:28:47,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 12:28:47,569 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 12:28:47,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:28:39" (3/4) ... [2024-10-13 12:28:47,572 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 12:28:47,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 12:28:47,573 INFO L158 Benchmark]: Toolchain (without parser) took 9308.43ms. Allocated memory was 65.0MB in the beginning and 157.3MB in the end (delta: 92.3MB). Free memory was 39.4MB in the beginning and 110.0MB in the end (delta: -70.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-13 12:28:47,574 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:47,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.00ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 41.1MB in the end (delta: -1.9MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-10-13 12:28:47,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.43ms. Allocated memory is still 88.1MB. Free memory was 41.1MB in the beginning and 66.3MB in the end (delta: -25.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 12:28:47,575 INFO L158 Benchmark]: Boogie Preprocessor took 70.95ms. Allocated memory is still 88.1MB. Free memory was 66.3MB in the beginning and 62.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 12:28:47,575 INFO L158 Benchmark]: RCFGBuilder took 779.58ms. Allocated memory is still 88.1MB. Free memory was 62.7MB in the beginning and 47.4MB in the end (delta: 15.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2024-10-13 12:28:47,575 INFO L158 Benchmark]: TraceAbstraction took 7769.40ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 46.8MB in the beginning and 110.0MB in the end (delta: -63.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-10-13 12:28:47,576 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 157.3MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:28:47,577 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.23ms. Allocated memory is still 65.0MB. Free memory was 41.6MB in the beginning and 41.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.00ms. Allocated memory was 65.0MB in the beginning and 88.1MB in the end (delta: 23.1MB). Free memory was 39.2MB in the beginning and 41.1MB in the end (delta: -1.9MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.43ms. Allocated memory is still 88.1MB. Free memory was 41.1MB in the beginning and 66.3MB in the end (delta: -25.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.95ms. Allocated memory is still 88.1MB. Free memory was 66.3MB in the beginning and 62.7MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 779.58ms. Allocated memory is still 88.1MB. Free memory was 62.7MB in the beginning and 47.4MB in the end (delta: 15.4MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7769.40ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 46.8MB in the beginning and 110.0MB in the end (delta: -63.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 157.3MB. Free memory is still 110.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3013]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 3013. Possible FailurePath: [L2989-L2992] 0 struct s { struct s *next; int datum; } *A, *B; [L2997] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L2997] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L2997] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L2997] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L2997] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L2997] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L2998] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L3014] 0 pthread_t t1; [L3015] 0 int *ip; [L3016] 0 struct s *sp; [L3017] 0 struct s *p = malloc(sizeof(struct s)); [L3018] CALL 0 init(p,9) [L2994] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}] [L2995] 0 p -> next = ((void *)0) [L3018] RET 0 init(p,9) [L3019] 0 A = malloc(sizeof(struct s)) [L3020] CALL 0 init(A,3) [L2994] 0 p -> datum = x VAL [A={2:0}, A_mutex={1:0}, B={0:0}] [L2995] 0 p -> next = ((void *)0) [L3020] RET 0 init(A,3) [L3021] 0 A->next = p [L3022] 0 B = malloc(sizeof(struct s)) [L3023] CALL 0 init(B,5) [L2994] 0 p -> datum = x VAL [A={2:0}, A_mutex={1:0}, B={3:0}] [L2995] 0 p -> next = ((void *)0) [L3023] RET 0 init(B,5) [L3024] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={2:0}, A_mutex={1:0}, B={3:0}, p={6:0}, t1=-1] [L3025] 0 ip = &p->datum [L3026] 0 sp = ((struct s *)((char *)(ip)-(unsigned long)__builtin_offsetof (struct s, datum))) VAL [A={2:0}, A_mutex={1:0}, B={3:0}, ip={6:4}, p={6:0}, sp={6:0}, t1=-1] [L3028] EXPR 0 A->next [L3028] 0 sp = A->next [L3029] 0 p->datum [L3031] 0 return 0; VAL [A={2:0}, A_mutex={1:0}, B={3:0}, \result=0, ip={6:4}, p={6:0}, sp={6:0}, t1=-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: -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: 3024]: 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. - 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 3 procedures, 80 locations, 40 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: 7.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 897 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 462 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 53 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 32, 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, 0.7s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 90 ConstructedInterpolants, 7 QuantifiedInterpolants, 557 SizeOfPredicates, 34 NumberOfNonLiveVariables, 1860 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 12:28:47,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample