./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/28-race_reach_90-arrayloop2_racing.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/28-race_reach_90-arrayloop2_racing.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 f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:33:31,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:33:31,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 12:33:31,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:33:31,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:33:31,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:33:31,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:33:31,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:33:31,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:33:31,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:33:31,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:33:31,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:33:31,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:33:31,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:33:31,419 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:33:31,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:33:31,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:33:31,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:33:31,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:33:31,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:33:31,422 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:33:31,422 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:33:31,422 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:33:31,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:33:31,422 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:33:31,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:33:31,423 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:33:31,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:33:31,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:33:31,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:33:31,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:33:31,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:33:31,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:33:31,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:33:31,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:33:31,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:33:31,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 12:33:31,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 12:33:31,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:33:31,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:33:31,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:33:31,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:33:31,427 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 -> f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af [2024-10-13 12:33:31,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:33:31,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:33:31,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:33:31,689 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:33:31,689 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:33:31,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2024-10-13 12:33:33,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:33:33,504 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:33:33,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2024-10-13 12:33:33,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283d33ea4/385632ae15854a2692a8bfd01730d016/FLAGdd5d70f70 [2024-10-13 12:33:33,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/283d33ea4/385632ae15854a2692a8bfd01730d016 [2024-10-13 12:33:33,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:33:33,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:33:33,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:33,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:33:33,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:33:33,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:33" (1/1) ... [2024-10-13 12:33:33,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6f766e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:33, skipping insertion in model container [2024-10-13 12:33:33,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:33" (1/1) ... [2024-10-13 12:33:33,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:33:34,093 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:34,094 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:34,094 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:34,094 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:34,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:34,149 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:33:34,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1d183d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:34, skipping insertion in model container [2024-10-13 12:33:34,150 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:34,150 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-13 12:33:34,152 INFO L158 Benchmark]: Toolchain (without parser) took 467.37ms. Allocated memory is still 138.4MB. Free memory was 70.4MB in the beginning and 99.4MB in the end (delta: -29.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-10-13 12:33:34,152 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 12:33:34,152 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.22ms. Allocated memory is still 138.4MB. Free memory was 70.2MB in the beginning and 99.4MB in the end (delta: -29.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-10-13 12:33:34,153 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 95.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 464.22ms. Allocated memory is still 138.4MB. Free memory was 70.2MB in the beginning and 99.4MB in the end (delta: -29.2MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1044]: 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/28-race_reach_90-arrayloop2_racing.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 f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 12:33:35,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 12:33:35,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-13 12:33:36,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 12:33:36,002 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 12:33:36,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 12:33:36,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 12:33:36,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 12:33:36,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 12:33:36,029 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 12:33:36,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 12:33:36,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 12:33:36,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 12:33:36,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 12:33:36,030 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 12:33:36,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 12:33:36,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 12:33:36,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 12:33:36,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 12:33:36,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 12:33:36,034 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 12:33:36,036 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 12:33:36,036 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 12:33:36,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 12:33:36,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 12:33:36,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 12:33:36,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 12:33:36,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 12:33:36,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 12:33:36,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:33:36,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 12:33:36,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 12:33:36,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 12:33:36,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 12:33:36,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 12:33:36,043 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 12:33:36,043 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 12:33:36,043 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 12:33:36,044 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 12:33:36,044 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 -> f41f3c018db74ffccd5759d166eb9816a1bf73b1747e3e539ecb5bf51feb56af [2024-10-13 12:33:36,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 12:33:36,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 12:33:36,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 12:33:36,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 12:33:36,341 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 12:33:36,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2024-10-13 12:33:37,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 12:33:37,896 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 12:33:37,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_90-arrayloop2_racing.i [2024-10-13 12:33:37,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7c45ba8/ab2b9cc3987d47f3a4c7e93c13d088a5/FLAGdcebc8ee0 [2024-10-13 12:33:37,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e7c45ba8/ab2b9cc3987d47f3a4c7e93c13d088a5 [2024-10-13 12:33:37,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 12:33:37,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 12:33:37,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:37,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 12:33:37,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 12:33:37,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:37" (1/1) ... [2024-10-13 12:33:37,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dbb775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:37, skipping insertion in model container [2024-10-13 12:33:37,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:33:37" (1/1) ... [2024-10-13 12:33:37,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:33:38,382 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,383 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,383 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,384 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:38,437 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-13 12:33:38,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 12:33:38,476 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,476 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,477 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,477 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:38,500 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 12:33:38,533 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,537 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,537 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,538 WARN L1659 CHandler]: Possible shadowing of function new [2024-10-13 12:33:38,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 12:33:38,625 INFO L204 MainTranslator]: Completed translation [2024-10-13 12:33:38,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38 WrapperNode [2024-10-13 12:33:38,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 12:33:38,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 12:33:38,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 12:33:38,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 12:33:38,632 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:33:38" (1/1) ... [2024-10-13 12:33:38,653 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:33:38" (1/1) ... [2024-10-13 12:33:38,677 INFO L138 Inliner]: procedures = 283, calls = 73, calls flagged for inlining = 11, calls inlined = 12, statements flattened = 327 [2024-10-13 12:33:38,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 12:33:38,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 12:33:38,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 12:33:38,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 12:33:38,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,718 INFO L175 MemorySlicer]: Split 37 memory accesses to 5 slices as follows [2, 2, 5, 26, 2]. 70 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0, 0]. The 17 writes are split as follows [0, 1, 0, 15, 1]. [2024-10-13 12:33:38,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 12:33:38,750 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 12:33:38,750 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 12:33:38,750 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 12:33:38,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (1/1) ... [2024-10-13 12:33:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 12:33:38,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 12:33:38,783 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:33:38,785 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:33:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 12:33:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 12:33:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 12:33:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 12:33:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-13 12:33:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure t1_fun [2024-10-13 12:33:38,819 INFO L138 BoogieDeclarations]: Found implementation of procedure t1_fun [2024-10-13 12:33:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 12:33:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-13 12:33:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-10-13 12:33:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2024-10-13 12:33:38,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 12:33:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 12:33:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-13 12:33:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 12:33:38,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 12:33:38,824 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:33:38,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 12:33:39,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 12:33:39,608 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 12:33:39,608 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 12:33:39,884 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 12:33:39,884 INFO L314 CfgBuilder]: Removed 30 assume(true) statements. [2024-10-13 12:33:39,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:33:39 BoogieIcfgContainer [2024-10-13 12:33:39,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 12:33:39,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 12:33:39,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 12:33:39,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 12:33:39,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:33:37" (1/3) ... [2024-10-13 12:33:39,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7477ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:33:39, skipping insertion in model container [2024-10-13 12:33:39,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:33:38" (2/3) ... [2024-10-13 12:33:39,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7477ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:33:39, skipping insertion in model container [2024-10-13 12:33:39,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:33:39" (3/3) ... [2024-10-13 12:33:39,892 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_90-arrayloop2_racing.i [2024-10-13 12:33:39,907 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 12:33:39,908 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-10-13 12:33:39,908 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 12:33:40,009 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-13 12:33:40,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 207 transitions, 434 flow [2024-10-13 12:33:40,149 INFO L124 PetriNetUnfolderBase]: 55/343 cut-off events. [2024-10-13 12:33:40,150 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-13 12:33:40,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 343 events. 55/343 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1940 event pairs, 0 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2024-10-13 12:33:40,159 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 207 transitions, 434 flow [2024-10-13 12:33:40,165 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 207 transitions, 434 flow [2024-10-13 12:33:40,176 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 12:33:40,181 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;@27eec542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 12:33:40,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2024-10-13 12:33:40,183 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 12:33:40,184 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2024-10-13 12:33:40,184 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 12:33:40,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:40,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:33:40,186 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:40,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:40,190 INFO L85 PathProgramCache]: Analyzing trace with hash 892204, now seen corresponding path program 1 times [2024-10-13 12:33:40,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353935259] [2024-10-13 12:33:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:40,201 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:33:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:40,218 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:33:40,219 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:33:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:40,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:33:40,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:40,412 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:33:40,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:40,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353935259] [2024-10-13 12:33:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353935259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:40,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:40,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588547177] [2024-10-13 12:33:40,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:40,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:40,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:40,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:41,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 207 [2024-10-13 12:33:41,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 207 transitions, 434 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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:33:41,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:41,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 207 [2024-10-13 12:33:41,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:43,780 INFO L124 PetriNetUnfolderBase]: 7529/17015 cut-off events. [2024-10-13 12:33:43,781 INFO L125 PetriNetUnfolderBase]: For 302/330 co-relation queries the response was YES. [2024-10-13 12:33:43,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28438 conditions, 17015 events. 7529/17015 cut-off events. For 302/330 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 163668 event pairs, 4501 based on Foata normal form. 2880/17304 useless extension candidates. Maximal degree in co-relation 27148. Up to 7851 conditions per place. [2024-10-13 12:33:43,898 INFO L140 encePairwiseOnDemand]: 175/207 looper letters, 119 selfloop transitions, 4 changer transitions 0/225 dead transitions. [2024-10-13 12:33:43,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 225 transitions, 716 flow [2024-10-13 12:33:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:43,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:43,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2024-10-13 12:33:43,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7041062801932367 [2024-10-13 12:33:43,916 INFO L175 Difference]: Start difference. First operand has 176 places, 207 transitions, 434 flow. Second operand 4 states and 583 transitions. [2024-10-13 12:33:43,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 225 transitions, 716 flow [2024-10-13 12:33:43,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 225 transitions, 716 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 12:33:43,927 INFO L231 Difference]: Finished difference. Result has 176 places, 179 transitions, 394 flow [2024-10-13 12:33:43,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=176, PETRI_TRANSITIONS=179} [2024-10-13 12:33:43,932 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2024-10-13 12:33:43,932 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 179 transitions, 394 flow [2024-10-13 12:33:43,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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:33:43,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:43,933 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-10-13 12:33:43,938 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:33:44,134 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:33:44,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:44,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:44,137 INFO L85 PathProgramCache]: Analyzing trace with hash 892205, now seen corresponding path program 1 times [2024-10-13 12:33:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146486554] [2024-10-13 12:33:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:44,139 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:33:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:44,142 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:33:44,142 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:33:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:44,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:33:44,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:44,366 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:33:44,366 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:44,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:44,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146486554] [2024-10-13 12:33:44,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146486554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:44,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:44,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:44,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119459879] [2024-10-13 12:33:44,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:44,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:44,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:44,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:44,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 207 [2024-10-13 12:33:44,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 179 transitions, 394 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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:33:44,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:44,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 207 [2024-10-13 12:33:44,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:46,319 INFO L124 PetriNetUnfolderBase]: 7464/17904 cut-off events. [2024-10-13 12:33:46,320 INFO L125 PetriNetUnfolderBase]: For 746/774 co-relation queries the response was YES. [2024-10-13 12:33:46,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30186 conditions, 17904 events. 7464/17904 cut-off events. For 746/774 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178127 event pairs, 6385 based on Foata normal form. 3/15193 useless extension candidates. Maximal degree in co-relation 28806. Up to 11048 conditions per place. [2024-10-13 12:33:46,406 INFO L140 encePairwiseOnDemand]: 199/207 looper letters, 76 selfloop transitions, 5 changer transitions 0/183 dead transitions. [2024-10-13 12:33:46,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 183 transitions, 570 flow [2024-10-13 12:33:46,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2024-10-13 12:33:46,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6038647342995169 [2024-10-13 12:33:46,409 INFO L175 Difference]: Start difference. First operand has 176 places, 179 transitions, 394 flow. Second operand 4 states and 500 transitions. [2024-10-13 12:33:46,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 183 transitions, 570 flow [2024-10-13 12:33:46,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 183 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:46,423 INFO L231 Difference]: Finished difference. Result has 178 places, 183 transitions, 427 flow [2024-10-13 12:33:46,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=427, PETRI_PLACES=178, PETRI_TRANSITIONS=183} [2024-10-13 12:33:46,424 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-10-13 12:33:46,425 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 183 transitions, 427 flow [2024-10-13 12:33:46,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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:33:46,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:46,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:33:46,431 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:33:46,626 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:33:46,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:46,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 810714522, now seen corresponding path program 1 times [2024-10-13 12:33:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287267940] [2024-10-13 12:33:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:46,629 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:33:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:46,631 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:33:46,632 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:33:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:46,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:33:46,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:46,778 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:33:46,784 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:33:46,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:46,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:46,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287267940] [2024-10-13 12:33:46,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287267940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:46,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:46,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:46,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414048738] [2024-10-13 12:33:46,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:46,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:33:46,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:46,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:33:46,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:33:46,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 207 [2024-10-13 12:33:46,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 183 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:33:46,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:46,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 207 [2024-10-13 12:33:46,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:48,574 INFO L124 PetriNetUnfolderBase]: 7464/17903 cut-off events. [2024-10-13 12:33:48,575 INFO L125 PetriNetUnfolderBase]: For 309/337 co-relation queries the response was YES. [2024-10-13 12:33:48,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29665 conditions, 17903 events. 7464/17903 cut-off events. For 309/337 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178031 event pairs, 6385 based on Foata normal form. 0/15188 useless extension candidates. Maximal degree in co-relation 29631. Up to 11044 conditions per place. [2024-10-13 12:33:48,675 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 74 selfloop transitions, 3 changer transitions 0/182 dead transitions. [2024-10-13 12:33:48,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 182 transitions, 579 flow [2024-10-13 12:33:48,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:33:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:33:48,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-13 12:33:48,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6360708534621579 [2024-10-13 12:33:48,678 INFO L175 Difference]: Start difference. First operand has 178 places, 183 transitions, 427 flow. Second operand 3 states and 395 transitions. [2024-10-13 12:33:48,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 182 transitions, 579 flow [2024-10-13 12:33:48,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 182 transitions, 576 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:33:48,684 INFO L231 Difference]: Finished difference. Result has 178 places, 182 transitions, 428 flow [2024-10-13 12:33:48,685 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=178, PETRI_TRANSITIONS=182} [2024-10-13 12:33:48,686 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-10-13 12:33:48,686 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 182 transitions, 428 flow [2024-10-13 12:33:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:33:48,687 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:48,687 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 12:33:48,695 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:33:48,890 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:33:48,891 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:48,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash 810714523, now seen corresponding path program 1 times [2024-10-13 12:33:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968454233] [2024-10-13 12:33:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:48,895 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:33:48,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:48,898 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:33:48,899 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:33:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:49,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 12:33:49,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:49,189 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:33:49,196 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:33:49,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:49,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968454233] [2024-10-13 12:33:49,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968454233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:49,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:49,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:49,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857293280] [2024-10-13 12:33:49,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:49,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:33:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:33:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:33:49,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 207 [2024-10-13 12:33:49,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 182 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:33:49,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:49,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 207 [2024-10-13 12:33:49,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:50,740 INFO L124 PetriNetUnfolderBase]: 7464/17902 cut-off events. [2024-10-13 12:33:50,740 INFO L125 PetriNetUnfolderBase]: For 311/339 co-relation queries the response was YES. [2024-10-13 12:33:50,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29665 conditions, 17902 events. 7464/17902 cut-off events. For 311/339 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178117 event pairs, 6385 based on Foata normal form. 0/15189 useless extension candidates. Maximal degree in co-relation 29630. Up to 11044 conditions per place. [2024-10-13 12:33:50,858 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 74 selfloop transitions, 3 changer transitions 0/181 dead transitions. [2024-10-13 12:33:50,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 181 transitions, 580 flow [2024-10-13 12:33:50,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:33:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:33:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2024-10-13 12:33:50,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6360708534621579 [2024-10-13 12:33:50,862 INFO L175 Difference]: Start difference. First operand has 178 places, 182 transitions, 428 flow. Second operand 3 states and 395 transitions. [2024-10-13 12:33:50,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 181 transitions, 580 flow [2024-10-13 12:33:50,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 181 transitions, 574 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:33:50,867 INFO L231 Difference]: Finished difference. Result has 177 places, 181 transitions, 426 flow [2024-10-13 12:33:50,868 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=177, PETRI_TRANSITIONS=181} [2024-10-13 12:33:50,869 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 1 predicate places. [2024-10-13 12:33:50,870 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 181 transitions, 426 flow [2024-10-13 12:33:50,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:33:50,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:50,870 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-13 12:33:50,875 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 (5)] Forceful destruction successful, exit code 0 [2024-10-13 12:33:51,071 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:33:51,072 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:51,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:51,073 INFO L85 PathProgramCache]: Analyzing trace with hash -637650438, now seen corresponding path program 1 times [2024-10-13 12:33:51,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:51,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182015173] [2024-10-13 12:33:51,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:51,074 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:33:51,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:51,077 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:33:51,093 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:33:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:51,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 12:33:51,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:51,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:51,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182015173] [2024-10-13 12:33:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182015173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:51,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:51,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:51,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541434135] [2024-10-13 12:33:51,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:51,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 12:33:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:51,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 12:33:51,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 12:33:51,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 207 [2024-10-13 12:33:51,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 181 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:33:51,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:51,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 207 [2024-10-13 12:33:51,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:52,560 INFO L124 PetriNetUnfolderBase]: 7463/17924 cut-off events. [2024-10-13 12:33:52,561 INFO L125 PetriNetUnfolderBase]: For 313/341 co-relation queries the response was YES. [2024-10-13 12:33:52,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29693 conditions, 17924 events. 7463/17924 cut-off events. For 313/341 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178046 event pairs, 6385 based on Foata normal form. 2/15202 useless extension candidates. Maximal degree in co-relation 29661. Up to 11044 conditions per place. [2024-10-13 12:33:52,686 INFO L140 encePairwiseOnDemand]: 204/207 looper letters, 78 selfloop transitions, 3 changer transitions 0/185 dead transitions. [2024-10-13 12:33:52,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 185 transitions, 600 flow [2024-10-13 12:33:52,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 12:33:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 12:33:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2024-10-13 12:33:52,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6489533011272142 [2024-10-13 12:33:52,689 INFO L175 Difference]: Start difference. First operand has 177 places, 181 transitions, 426 flow. Second operand 3 states and 403 transitions. [2024-10-13 12:33:52,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 185 transitions, 600 flow [2024-10-13 12:33:52,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 185 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:33:52,693 INFO L231 Difference]: Finished difference. Result has 178 places, 181 transitions, 431 flow [2024-10-13 12:33:52,693 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=178, PETRI_TRANSITIONS=181} [2024-10-13 12:33:52,694 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-10-13 12:33:52,694 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 181 transitions, 431 flow [2024-10-13 12:33:52,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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:33:52,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:52,694 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:52,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-10-13 12:33:52,896 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:33:52,897 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:52,898 INFO L85 PathProgramCache]: Analyzing trace with hash -637652670, now seen corresponding path program 1 times [2024-10-13 12:33:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:52,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053576697] [2024-10-13 12:33:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:52,899 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:33:52,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:52,901 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:33:52,902 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:33:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:52,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 12:33:52,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:53,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:33:53,039 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:33:53,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:53,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:53,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053576697] [2024-10-13 12:33:53,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053576697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:53,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:53,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:53,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107004756] [2024-10-13 12:33:53,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:53,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:53,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:53,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:53,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:53,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 207 [2024-10-13 12:33:53,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 181 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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:33:53,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:53,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 207 [2024-10-13 12:33:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:55,101 INFO L124 PetriNetUnfolderBase]: 7463/17920 cut-off events. [2024-10-13 12:33:55,102 INFO L125 PetriNetUnfolderBase]: For 328/356 co-relation queries the response was YES. [2024-10-13 12:33:55,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29693 conditions, 17920 events. 7463/17920 cut-off events. For 328/356 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178077 event pairs, 6385 based on Foata normal form. 2/15202 useless extension candidates. Maximal degree in co-relation 29657. Up to 11048 conditions per place. [2024-10-13 12:33:55,163 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 75 selfloop transitions, 4 changer transitions 0/179 dead transitions. [2024-10-13 12:33:55,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 179 transitions, 585 flow [2024-10-13 12:33:55,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:55,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:55,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2024-10-13 12:33:55,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5905797101449275 [2024-10-13 12:33:55,165 INFO L175 Difference]: Start difference. First operand has 178 places, 181 transitions, 431 flow. Second operand 4 states and 489 transitions. [2024-10-13 12:33:55,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 179 transitions, 585 flow [2024-10-13 12:33:55,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 179 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:33:55,169 INFO L231 Difference]: Finished difference. Result has 178 places, 179 transitions, 432 flow [2024-10-13 12:33:55,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=178, PETRI_TRANSITIONS=179} [2024-10-13 12:33:55,170 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 2 predicate places. [2024-10-13 12:33:55,172 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 179 transitions, 432 flow [2024-10-13 12:33:55,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 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:33:55,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:55,172 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:55,176 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:33:55,372 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:33:55,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:55,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:55,374 INFO L85 PathProgramCache]: Analyzing trace with hash -637652671, now seen corresponding path program 1 times [2024-10-13 12:33:55,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:55,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291276515] [2024-10-13 12:33:55,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:55,376 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:33:55,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:55,377 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:33:55,379 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:33:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:55,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 12:33:55,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:55,510 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:33:55,535 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:33:55,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:55,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:55,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291276515] [2024-10-13 12:33:55,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291276515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:55,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:55,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:55,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043274351] [2024-10-13 12:33:55,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:55,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:55,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:55,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:55,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:55,799 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 207 [2024-10-13 12:33:55,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 179 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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:33:55,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:55,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 207 [2024-10-13 12:33:55,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:57,117 INFO L124 PetriNetUnfolderBase]: 7463/17916 cut-off events. [2024-10-13 12:33:57,117 INFO L125 PetriNetUnfolderBase]: For 313/341 co-relation queries the response was YES. [2024-10-13 12:33:57,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29697 conditions, 17916 events. 7463/17916 cut-off events. For 313/341 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178100 event pairs, 6385 based on Foata normal form. 2/15200 useless extension candidates. Maximal degree in co-relation 29661. Up to 11046 conditions per place. [2024-10-13 12:33:57,240 INFO L140 encePairwiseOnDemand]: 200/207 looper letters, 72 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2024-10-13 12:33:57,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 177 transitions, 586 flow [2024-10-13 12:33:57,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 12:33:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 12:33:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2024-10-13 12:33:57,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5623188405797102 [2024-10-13 12:33:57,242 INFO L175 Difference]: Start difference. First operand has 178 places, 179 transitions, 432 flow. Second operand 5 states and 582 transitions. [2024-10-13 12:33:57,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 177 transitions, 586 flow [2024-10-13 12:33:57,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 177 transitions, 578 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:33:57,246 INFO L231 Difference]: Finished difference. Result has 177 places, 177 transitions, 434 flow [2024-10-13 12:33:57,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=434, PETRI_PLACES=177, PETRI_TRANSITIONS=177} [2024-10-13 12:33:57,250 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 1 predicate places. [2024-10-13 12:33:57,250 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 177 transitions, 434 flow [2024-10-13 12:33:57,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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:33:57,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:57,250 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:57,255 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 12:33:57,454 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:33:57,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:57,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1396137565, now seen corresponding path program 1 times [2024-10-13 12:33:57,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:57,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797718700] [2024-10-13 12:33:57,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:57,455 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:33:57,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:57,457 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:33:57,458 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:33:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:57,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 12:33:57,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:57,783 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-13 12:33:57,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-10-13 12:33:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:33:57,821 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:57,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797718700] [2024-10-13 12:33:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797718700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 12:33:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414972297] [2024-10-13 12:33:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:57,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:33:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:57,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:33:57,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:33:57,978 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 207 [2024-10-13 12:33:57,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 177 transitions, 434 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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:33:57,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:33:57,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 207 [2024-10-13 12:33:57,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:33:59,112 INFO L124 PetriNetUnfolderBase]: 7529/17028 cut-off events. [2024-10-13 12:33:59,112 INFO L125 PetriNetUnfolderBase]: For 367/395 co-relation queries the response was YES. [2024-10-13 12:33:59,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29119 conditions, 17028 events. 7529/17028 cut-off events. For 367/395 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 163619 event pairs, 4501 based on Foata normal form. 2/14536 useless extension candidates. Maximal degree in co-relation 29081. Up to 7854 conditions per place. [2024-10-13 12:33:59,195 INFO L140 encePairwiseOnDemand]: 201/207 looper letters, 120 selfloop transitions, 5 changer transitions 0/221 dead transitions. [2024-10-13 12:33:59,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 221 transitions, 772 flow [2024-10-13 12:33:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:33:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:33:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2024-10-13 12:33:59,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6509661835748792 [2024-10-13 12:33:59,197 INFO L175 Difference]: Start difference. First operand has 177 places, 177 transitions, 434 flow. Second operand 4 states and 539 transitions. [2024-10-13 12:33:59,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 221 transitions, 772 flow [2024-10-13 12:33:59,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 221 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 12:33:59,201 INFO L231 Difference]: Finished difference. Result has 174 places, 175 transitions, 426 flow [2024-10-13 12:33:59,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=426, PETRI_PLACES=174, PETRI_TRANSITIONS=175} [2024-10-13 12:33:59,202 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, -2 predicate places. [2024-10-13 12:33:59,202 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 175 transitions, 426 flow [2024-10-13 12:33:59,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 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:33:59,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:33:59,203 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:33:59,217 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:33:59,403 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:33:59,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:33:59,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:33:59,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1396137566, now seen corresponding path program 1 times [2024-10-13 12:33:59,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:33:59,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874072558] [2024-10-13 12:33:59,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:33:59,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:33:59,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:33:59,405 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:33:59,407 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:33:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:33:59,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 12:33:59,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:33:59,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 12:33:59,636 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:33:59,702 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:33:59,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:33:59,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:33:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874072558] [2024-10-13 12:33:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874072558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:33:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:33:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:33:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103488859] [2024-10-13 12:33:59,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:33:59,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 12:33:59,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:33:59,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 12:33:59,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 12:34:00,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 207 [2024-10-13 12:34:00,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 175 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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:34:00,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:00,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 207 [2024-10-13 12:34:00,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:01,602 INFO L124 PetriNetUnfolderBase]: 7608/18232 cut-off events. [2024-10-13 12:34:01,603 INFO L125 PetriNetUnfolderBase]: For 845/873 co-relation queries the response was YES. [2024-10-13 12:34:01,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30869 conditions, 18232 events. 7608/18232 cut-off events. For 845/873 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 181847 event pairs, 6517 based on Foata normal form. 2/15488 useless extension candidates. Maximal degree in co-relation 30777. Up to 11287 conditions per place. [2024-10-13 12:34:01,684 INFO L140 encePairwiseOnDemand]: 201/207 looper letters, 83 selfloop transitions, 5 changer transitions 0/182 dead transitions. [2024-10-13 12:34:01,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 182 transitions, 632 flow [2024-10-13 12:34:01,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:34:01,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:34:01,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 503 transitions. [2024-10-13 12:34:01,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.607487922705314 [2024-10-13 12:34:01,687 INFO L175 Difference]: Start difference. First operand has 174 places, 175 transitions, 426 flow. Second operand 4 states and 503 transitions. [2024-10-13 12:34:01,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 182 transitions, 632 flow [2024-10-13 12:34:01,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 182 transitions, 616 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:34:01,699 INFO L231 Difference]: Finished difference. Result has 176 places, 179 transitions, 462 flow [2024-10-13 12:34:01,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=462, PETRI_PLACES=176, PETRI_TRANSITIONS=179} [2024-10-13 12:34:01,700 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 0 predicate places. [2024-10-13 12:34:01,700 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 179 transitions, 462 flow [2024-10-13 12:34:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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:34:01,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:01,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:01,707 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:34:01,905 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:34:01,906 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 330592575, now seen corresponding path program 1 times [2024-10-13 12:34:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1421069302] [2024-10-13 12:34:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:01,907 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:34:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:01,912 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:34:01,919 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:34:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:02,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 12:34:02,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:02,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:34:02,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 37 treesize of output 15 [2024-10-13 12:34:02,269 INFO L349 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2024-10-13 12:34:02,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2024-10-13 12:34:02,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-10-13 12:34:02,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-10-13 12:34:02,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-13 12:34:02,394 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:34:02,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:34:02,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:02,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1421069302] [2024-10-13 12:34:02,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1421069302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:34:02,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:34:02,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:34:02,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849988978] [2024-10-13 12:34:02,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:34:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:34:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:02,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:34:02,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:34:03,779 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 207 [2024-10-13 12:34:03,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 179 transitions, 462 flow. Second operand has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:34:03,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:03,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 207 [2024-10-13 12:34:03,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:06,200 INFO L124 PetriNetUnfolderBase]: 7530/17056 cut-off events. [2024-10-13 12:34:06,200 INFO L125 PetriNetUnfolderBase]: For 366/394 co-relation queries the response was YES. [2024-10-13 12:34:06,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29193 conditions, 17056 events. 7530/17056 cut-off events. For 366/394 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 164112 event pairs, 4501 based on Foata normal form. 0/14564 useless extension candidates. Maximal degree in co-relation 29100. Up to 7866 conditions per place. [2024-10-13 12:34:06,280 INFO L140 encePairwiseOnDemand]: 195/207 looper letters, 128 selfloop transitions, 16 changer transitions 0/234 dead transitions. [2024-10-13 12:34:06,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 234 transitions, 868 flow [2024-10-13 12:34:06,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:34:06,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:34:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1182 transitions. [2024-10-13 12:34:06,283 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5191040843214756 [2024-10-13 12:34:06,283 INFO L175 Difference]: Start difference. First operand has 176 places, 179 transitions, 462 flow. Second operand 11 states and 1182 transitions. [2024-10-13 12:34:06,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 234 transitions, 868 flow [2024-10-13 12:34:06,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 234 transitions, 866 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 12:34:06,287 INFO L231 Difference]: Finished difference. Result has 190 places, 185 transitions, 541 flow [2024-10-13 12:34:06,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=541, PETRI_PLACES=190, PETRI_TRANSITIONS=185} [2024-10-13 12:34:06,288 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 14 predicate places. [2024-10-13 12:34:06,288 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 185 transitions, 541 flow [2024-10-13 12:34:06,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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:34:06,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:06,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:06,294 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:34:06,492 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:34:06,493 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:06,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:06,493 INFO L85 PathProgramCache]: Analyzing trace with hash 330592576, now seen corresponding path program 1 times [2024-10-13 12:34:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:06,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534395602] [2024-10-13 12:34:06,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:06,494 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:34:06,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:06,495 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:34:06,497 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:34:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:06,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 12:34:06,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:06,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:34:06,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 12:34:06,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-10-13 12:34:06,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-10-13 12:34:06,835 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:34:06,836 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:34:06,847 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:34:06,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-13 12:34:06,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-10-13 12:34:06,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-13 12:34:06,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-10-13 12:34:06,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-13 12:34:07,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 16 [2024-10-13 12:34:07,053 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:34:07,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:34:07,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:07,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534395602] [2024-10-13 12:34:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534395602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:34:07,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:34:07,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 12:34:07,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584318464] [2024-10-13 12:34:07,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:34:07,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 12:34:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:07,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 12:34:07,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-13 12:34:08,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 207 [2024-10-13 12:34:08,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 185 transitions, 541 flow. Second operand has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 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:34:08,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:08,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 207 [2024-10-13 12:34:08,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:10,523 INFO L124 PetriNetUnfolderBase]: 7608/18229 cut-off events. [2024-10-13 12:34:10,523 INFO L125 PetriNetUnfolderBase]: For 859/887 co-relation queries the response was YES. [2024-10-13 12:34:10,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30947 conditions, 18229 events. 7608/18229 cut-off events. For 859/887 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 181896 event pairs, 6517 based on Foata normal form. 1/15503 useless extension candidates. Maximal degree in co-relation 30809. Up to 11300 conditions per place. [2024-10-13 12:34:10,682 INFO L140 encePairwiseOnDemand]: 195/207 looper letters, 103 selfloop transitions, 11 changer transitions 0/200 dead transitions. [2024-10-13 12:34:10,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 200 transitions, 822 flow [2024-10-13 12:34:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:34:10,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:34:10,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1088 transitions. [2024-10-13 12:34:10,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47782169521299955 [2024-10-13 12:34:10,686 INFO L175 Difference]: Start difference. First operand has 190 places, 185 transitions, 541 flow. Second operand 11 states and 1088 transitions. [2024-10-13 12:34:10,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 200 transitions, 822 flow [2024-10-13 12:34:10,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 200 transitions, 802 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 12:34:10,702 INFO L231 Difference]: Finished difference. Result has 199 places, 189 transitions, 582 flow [2024-10-13 12:34:10,702 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=582, PETRI_PLACES=199, PETRI_TRANSITIONS=189} [2024-10-13 12:34:10,702 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 23 predicate places. [2024-10-13 12:34:10,703 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 189 transitions, 582 flow [2024-10-13 12:34:10,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 90.0) internal successors, (900), 10 states have internal predecessors, (900), 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:34:10,703 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:10,703 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:10,709 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:34:10,904 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:34:10,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:10,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:10,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1658436134, now seen corresponding path program 1 times [2024-10-13 12:34:10,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:10,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111817685] [2024-10-13 12:34:10,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:10,905 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:34:10,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:10,906 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-13 12:34:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:11,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 12:34:11,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:11,043 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:34:11,061 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:34:11,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:34:11,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:11,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111817685] [2024-10-13 12:34:11,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111817685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:34:11,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:34:11,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:34:11,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818030308] [2024-10-13 12:34:11,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:34:11,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:34:11,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:34:11,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:34:11,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 207 [2024-10-13 12:34:11,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 189 transitions, 582 flow. Second operand has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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:34:11,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:11,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 207 [2024-10-13 12:34:11,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:13,065 INFO L124 PetriNetUnfolderBase]: 7464/17931 cut-off events. [2024-10-13 12:34:13,065 INFO L125 PetriNetUnfolderBase]: For 381/409 co-relation queries the response was YES. [2024-10-13 12:34:13,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29808 conditions, 17931 events. 7464/17931 cut-off events. For 381/409 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178432 event pairs, 6385 based on Foata normal form. 0/15227 useless extension candidates. Maximal degree in co-relation 29686. Up to 11045 conditions per place. [2024-10-13 12:34:13,237 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 79 selfloop transitions, 11 changer transitions 0/187 dead transitions. [2024-10-13 12:34:13,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 187 transitions, 758 flow [2024-10-13 12:34:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:34:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:34:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2024-10-13 12:34:13,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5905797101449275 [2024-10-13 12:34:13,240 INFO L175 Difference]: Start difference. First operand has 199 places, 189 transitions, 582 flow. Second operand 4 states and 489 transitions. [2024-10-13 12:34:13,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 187 transitions, 758 flow [2024-10-13 12:34:13,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 187 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 12:34:13,245 INFO L231 Difference]: Finished difference. Result has 198 places, 187 transitions, 596 flow [2024-10-13 12:34:13,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=596, PETRI_PLACES=198, PETRI_TRANSITIONS=187} [2024-10-13 12:34:13,246 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 22 predicate places. [2024-10-13 12:34:13,246 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 187 transitions, 596 flow [2024-10-13 12:34:13,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.0) internal successors, (420), 4 states have internal predecessors, (420), 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:34:13,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:13,246 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:13,252 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 (13)] Ended with exit code 0 [2024-10-13 12:34:13,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:13,447 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:13,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1658436135, now seen corresponding path program 1 times [2024-10-13 12:34:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:13,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116816822] [2024-10-13 12:34:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:13,448 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:34:13,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:13,451 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:13,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-13 12:34:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:13,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:34:13,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:13,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-13 12:34:13,626 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:34:13,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 12:34:13,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:13,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116816822] [2024-10-13 12:34:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116816822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 12:34:13,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 12:34:13,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 12:34:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009349362] [2024-10-13 12:34:13,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 12:34:13,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 12:34:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:13,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 12:34:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 12:34:13,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 207 [2024-10-13 12:34:13,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 187 transitions, 596 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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:34:13,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:13,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 207 [2024-10-13 12:34:13,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:15,443 INFO L124 PetriNetUnfolderBase]: 7464/17923 cut-off events. [2024-10-13 12:34:15,443 INFO L125 PetriNetUnfolderBase]: For 424/452 co-relation queries the response was YES. [2024-10-13 12:34:15,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29802 conditions, 17923 events. 7464/17923 cut-off events. For 424/452 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 178292 event pairs, 6385 based on Foata normal form. 8/15227 useless extension candidates. Maximal degree in co-relation 29682. Up to 11045 conditions per place. [2024-10-13 12:34:15,637 INFO L140 encePairwiseOnDemand]: 202/207 looper letters, 77 selfloop transitions, 11 changer transitions 0/185 dead transitions. [2024-10-13 12:34:15,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 185 transitions, 768 flow [2024-10-13 12:34:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 12:34:15,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 12:34:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2024-10-13 12:34:15,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-10-13 12:34:15,640 INFO L175 Difference]: Start difference. First operand has 198 places, 187 transitions, 596 flow. Second operand 4 states and 495 transitions. [2024-10-13 12:34:15,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 185 transitions, 768 flow [2024-10-13 12:34:15,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 185 transitions, 746 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:34:15,647 INFO L231 Difference]: Finished difference. Result has 196 places, 185 transitions, 592 flow [2024-10-13 12:34:15,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=592, PETRI_PLACES=196, PETRI_TRANSITIONS=185} [2024-10-13 12:34:15,648 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 20 predicate places. [2024-10-13 12:34:15,648 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 185 transitions, 592 flow [2024-10-13 12:34:15,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 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:34:15,648 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:15,648 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:15,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-13 12:34:15,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:15,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:15,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:15,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1482308760, now seen corresponding path program 1 times [2024-10-13 12:34:15,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883926572] [2024-10-13 12:34:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:15,851 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:34:15,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:15,855 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:15,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-13 12:34:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:15,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 12:34:15,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:16,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:16,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:16,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:16,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:16,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883926572] [2024-10-13 12:34:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883926572] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:16,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:16,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-10-13 12:34:16,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717762787] [2024-10-13 12:34:16,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:16,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 12:34:16,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:16,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 12:34:16,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 12:34:16,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 207 [2024-10-13 12:34:16,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 185 transitions, 592 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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:34:16,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:16,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 207 [2024-10-13 12:34:16,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:17,633 INFO L124 PetriNetUnfolderBase]: 7464/17973 cut-off events. [2024-10-13 12:34:17,633 INFO L125 PetriNetUnfolderBase]: For 500/528 co-relation queries the response was YES. [2024-10-13 12:34:17,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29944 conditions, 17973 events. 7464/17973 cut-off events. For 500/528 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 178737 event pairs, 6385 based on Foata normal form. 6/15271 useless extension candidates. Maximal degree in co-relation 29751. Up to 11041 conditions per place. [2024-10-13 12:34:17,812 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 92 selfloop transitions, 11 changer transitions 0/200 dead transitions. [2024-10-13 12:34:17,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 200 transitions, 910 flow [2024-10-13 12:34:17,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 12:34:17,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 12:34:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions. [2024-10-13 12:34:17,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5958132045088567 [2024-10-13 12:34:17,815 INFO L175 Difference]: Start difference. First operand has 196 places, 185 transitions, 592 flow. Second operand 6 states and 740 transitions. [2024-10-13 12:34:17,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 200 transitions, 910 flow [2024-10-13 12:34:17,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 200 transitions, 866 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 12:34:17,820 INFO L231 Difference]: Finished difference. Result has 202 places, 190 transitions, 658 flow [2024-10-13 12:34:17,820 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=202, PETRI_TRANSITIONS=190} [2024-10-13 12:34:17,820 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 26 predicate places. [2024-10-13 12:34:17,820 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 190 transitions, 658 flow [2024-10-13 12:34:17,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 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:34:17,821 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:17,821 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:17,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-13 12:34:18,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:18,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:18,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:18,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1459027486, now seen corresponding path program 1 times [2024-10-13 12:34:18,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:18,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710372275] [2024-10-13 12:34:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:18,023 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:34:18,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:18,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:18,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-13 12:34:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:18,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 12:34:18,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:18,357 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:34:18,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-13 12:34:18,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-13 12:34:18,494 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-13 12:34:18,494 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:34:18,511 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-10-13 12:34:18,511 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 1 case distinctions, treesize of input 20 treesize of output 22 [2024-10-13 12:34:18,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-10-13 12:34:18,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 17 [2024-10-13 12:34:18,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 20 treesize of output 15 [2024-10-13 12:34:18,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 17 [2024-10-13 12:34:18,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 13 [2024-10-13 12:34:18,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 16 treesize of output 11 [2024-10-13 12:34:18,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-10-13 12:34:18,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-10-13 12:34:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:18,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:18,874 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_624) |c_~#c~0.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_624) |c_~#c~0.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_623) |c_~#c~0.base|) .cse1)))))) is different from false [2024-10-13 12:34:18,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (and (forall ((v_ArrVal_623 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_624) |c_~#c~0.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_623) |c_~#c~0.base|) .cse0)))) (forall ((v_ArrVal_624 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_624) |c_~#c~0.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-10-13 12:34:19,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:19,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 109 [2024-10-13 12:34:19,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:19,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 85 [2024-10-13 12:34:19,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:19,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 118 treesize of output 121 [2024-10-13 12:34:19,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:19,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 184 treesize of output 163 [2024-10-13 12:34:19,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 85 [2024-10-13 12:34:19,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 79 [2024-10-13 12:34:19,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:19,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 112 [2024-10-13 12:34:19,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2024-10-13 12:34:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 12:34:20,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:20,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710372275] [2024-10-13 12:34:20,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710372275] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:20,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:20,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 12:34:20,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381276645] [2024-10-13 12:34:20,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:20,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:34:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:20,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:34:20,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=153, Unknown=3, NotChecked=50, Total=240 [2024-10-13 12:34:20,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 207 [2024-10-13 12:34:20,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 190 transitions, 658 flow. Second operand has 16 states, 16 states have (on average 42.125) internal successors, (674), 16 states have internal predecessors, (674), 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:34:20,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:20,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 207 [2024-10-13 12:34:20,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:31,706 INFO L124 PetriNetUnfolderBase]: 47994/84739 cut-off events. [2024-10-13 12:34:31,707 INFO L125 PetriNetUnfolderBase]: For 789/789 co-relation queries the response was YES. [2024-10-13 12:34:32,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157733 conditions, 84739 events. 47994/84739 cut-off events. For 789/789 co-relation queries the response was YES. Maximal size of possible extension queue 2538. Compared 826123 event pairs, 43378 based on Foata normal form. 6/53221 useless extension candidates. Maximal degree in co-relation 157508. Up to 70881 conditions per place. [2024-10-13 12:34:32,461 INFO L140 encePairwiseOnDemand]: 198/207 looper letters, 132 selfloop transitions, 23 changer transitions 0/195 dead transitions. [2024-10-13 12:34:32,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 195 transitions, 982 flow [2024-10-13 12:34:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 12:34:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 12:34:32,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 579 transitions. [2024-10-13 12:34:32,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.25428194993412384 [2024-10-13 12:34:32,464 INFO L175 Difference]: Start difference. First operand has 202 places, 190 transitions, 658 flow. Second operand 11 states and 579 transitions. [2024-10-13 12:34:32,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 195 transitions, 982 flow [2024-10-13 12:34:32,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 195 transitions, 964 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-13 12:34:32,468 INFO L231 Difference]: Finished difference. Result has 212 places, 191 transitions, 694 flow [2024-10-13 12:34:32,469 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=694, PETRI_PLACES=212, PETRI_TRANSITIONS=191} [2024-10-13 12:34:32,469 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 36 predicate places. [2024-10-13 12:34:32,469 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 694 flow [2024-10-13 12:34:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 42.125) internal successors, (674), 16 states have internal predecessors, (674), 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:34:32,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:32,470 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 12:34:32,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-13 12:34:32,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:32,673 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:32,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1459027487, now seen corresponding path program 1 times [2024-10-13 12:34:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1513570758] [2024-10-13 12:34:32,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 12:34:32,674 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:34:32,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:32,675 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:32,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-13 12:34:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 12:34:32,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 12:34:32,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:32,995 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:34:33,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-10-13 12:34:33,117 INFO L349 Elim1Store]: treesize reduction 90, result has 30.2 percent of original size [2024-10-13 12:34:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 52 [2024-10-13 12:34:33,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 29 [2024-10-13 12:34:33,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 36 treesize of output 29 [2024-10-13 12:34:33,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 21 [2024-10-13 12:34:33,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 12:34:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:33,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:33,291 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_INIT_LIST_HEAD_~list#1.base| v_ArrVal_730) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|)))) (_ bv1 1)))) is different from false [2024-10-13 12:34:33,302 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_new_~p~0#1.base| v_ArrVal_730) |c_~#c~0.base|) (bvadd |c_~#c~0.offset| (bvmul (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|))))) (_ bv0 1))) is different from false [2024-10-13 12:34:33,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:33,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-13 12:34:33,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 12:34:33,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 52 treesize of output 55 [2024-10-13 12:34:33,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2024-10-13 12:34:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 12:34:34,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:34,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1513570758] [2024-10-13 12:34:34,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1513570758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:34,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:34,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-13 12:34:34,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645585851] [2024-10-13 12:34:34,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:34,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-13 12:34:34,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-13 12:34:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=145, Unknown=6, NotChecked=50, Total=240 [2024-10-13 12:34:34,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 207 [2024-10-13 12:34:34,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 694 flow. Second operand has 16 states, 16 states have (on average 58.125) internal successors, (930), 16 states have internal predecessors, (930), 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:34:34,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:34,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 207 [2024-10-13 12:34:34,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:41,547 INFO L124 PetriNetUnfolderBase]: 27748/54504 cut-off events. [2024-10-13 12:34:41,548 INFO L125 PetriNetUnfolderBase]: For 696/696 co-relation queries the response was YES. [2024-10-13 12:34:41,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97133 conditions, 54504 events. 27748/54504 cut-off events. For 696/696 co-relation queries the response was YES. Maximal size of possible extension queue 1603. Compared 553883 event pairs, 24779 based on Foata normal form. 0/41007 useless extension candidates. Maximal degree in co-relation 96891. Up to 40959 conditions per place. [2024-10-13 12:34:41,918 INFO L140 encePairwiseOnDemand]: 199/207 looper letters, 116 selfloop transitions, 22 changer transitions 0/194 dead transitions. [2024-10-13 12:34:41,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 194 transitions, 978 flow [2024-10-13 12:34:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 12:34:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 12:34:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 682 transitions. [2024-10-13 12:34:41,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3294685990338164 [2024-10-13 12:34:41,920 INFO L175 Difference]: Start difference. First operand has 212 places, 191 transitions, 694 flow. Second operand 10 states and 682 transitions. [2024-10-13 12:34:41,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 194 transitions, 978 flow [2024-10-13 12:34:41,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 194 transitions, 897 flow, removed 11 selfloop flow, removed 11 redundant places. [2024-10-13 12:34:41,925 INFO L231 Difference]: Finished difference. Result has 209 places, 190 transitions, 653 flow [2024-10-13 12:34:41,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=653, PETRI_PLACES=209, PETRI_TRANSITIONS=190} [2024-10-13 12:34:41,925 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 33 predicate places. [2024-10-13 12:34:41,926 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 190 transitions, 653 flow [2024-10-13 12:34:41,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 58.125) internal successors, (930), 16 states have internal predecessors, (930), 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:34:41,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:41,926 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1] [2024-10-13 12:34:41,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-13 12:34:42,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:42,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1473155718, now seen corresponding path program 2 times [2024-10-13 12:34:42,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:42,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891847267] [2024-10-13 12:34:42,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 12:34:42,131 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:34:42,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:42,132 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:42,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-13 12:34:42,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 12:34:42,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:34:42,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 12:34:42,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:42,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:42,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:42,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891847267] [2024-10-13 12:34:42,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891847267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:42,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:42,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-13 12:34:42,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598952134] [2024-10-13 12:34:42,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:42,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 12:34:42,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:42,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 12:34:42,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-13 12:34:42,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 207 [2024-10-13 12:34:42,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 190 transitions, 653 flow. Second operand has 12 states, 12 states have (on average 111.91666666666667) internal successors, (1343), 12 states have internal predecessors, (1343), 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:34:42,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:42,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 207 [2024-10-13 12:34:42,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 12:34:45,524 INFO L124 PetriNetUnfolderBase]: 7464/18081 cut-off events. [2024-10-13 12:34:45,524 INFO L125 PetriNetUnfolderBase]: For 788/816 co-relation queries the response was YES. [2024-10-13 12:34:45,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30351 conditions, 18081 events. 7464/18081 cut-off events. For 788/816 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 178999 event pairs, 6385 based on Foata normal form. 12/15391 useless extension candidates. Maximal degree in co-relation 29948. Up to 11041 conditions per place. [2024-10-13 12:34:45,604 INFO L140 encePairwiseOnDemand]: 203/207 looper letters, 122 selfloop transitions, 23 changer transitions 0/242 dead transitions. [2024-10-13 12:34:45,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 242 transitions, 1387 flow [2024-10-13 12:34:45,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 12:34:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 12:34:45,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1421 transitions. [2024-10-13 12:34:45,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.572061191626409 [2024-10-13 12:34:45,607 INFO L175 Difference]: Start difference. First operand has 209 places, 190 transitions, 653 flow. Second operand 12 states and 1421 transitions. [2024-10-13 12:34:45,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 242 transitions, 1387 flow [2024-10-13 12:34:45,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 242 transitions, 1239 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-10-13 12:34:45,612 INFO L231 Difference]: Finished difference. Result has 218 places, 203 transitions, 837 flow [2024-10-13 12:34:45,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=837, PETRI_PLACES=218, PETRI_TRANSITIONS=203} [2024-10-13 12:34:45,613 INFO L277 CegarLoopForPetriNet]: 176 programPoint places, 42 predicate places. [2024-10-13 12:34:45,613 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 203 transitions, 837 flow [2024-10-13 12:34:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.91666666666667) internal successors, (1343), 12 states have internal predecessors, (1343), 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:34:45,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 12:34:45,613 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1] [2024-10-13 12:34:45,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-10-13 12:34:45,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 12:34:45,817 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t2_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, t2_funErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 88 more)] === [2024-10-13 12:34:45,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 12:34:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash -387239238, now seen corresponding path program 3 times [2024-10-13 12:34:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 12:34:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636325371] [2024-10-13 12:34:45,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 12:34:45,818 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:34:45,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 12:34:45,821 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 12:34:45,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-13 12:34:53,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2024-10-13 12:34:53,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 12:34:53,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 1430 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 12:34:53,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 12:34:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:53,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 12:34:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 2 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 12:34:53,787 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 12:34:53,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636325371] [2024-10-13 12:34:53,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636325371] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 12:34:53,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 12:34:53,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2024-10-13 12:34:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363945468] [2024-10-13 12:34:53,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 12:34:53,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 12:34:53,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 12:34:53,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 12:34:53,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2024-10-13 12:34:53,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 207 [2024-10-13 12:34:53,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 203 transitions, 837 flow. Second operand has 24 states, 24 states have (on average 112.45833333333333) internal successors, (2699), 24 states have internal predecessors, (2699), 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:34:53,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 12:34:53,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 207 [2024-10-13 12:34:53,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand